./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6ecf82a71a4459906964f052db8bbf04a27512c5e70ab06337f5d3d2ad3e980 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:45:02,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:45:02,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:45:02,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:45:02,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:45:02,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:45:02,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:45:02,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:45:02,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:45:02,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:45:02,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:45:02,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:45:02,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:45:02,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:45:02,086 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:45:02,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:45:02,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:45:02,086 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:45:02,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:45:02,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:45:02,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:45:02,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:45:02,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:45:02,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:45:02,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:45:02,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:45:02,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:45:02,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:45:02,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:45:02,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:45:02,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:45:02,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:45:02,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6ecf82a71a4459906964f052db8bbf04a27512c5e70ab06337f5d3d2ad3e980 [2025-03-08 11:45:02,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:45:02,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:45:02,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:45:02,323 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:45:02,323 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:45:02,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i [2025-03-08 11:45:03,537 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110fa81b9/35c0f8c54daa4c0cb780aa555c888486/FLAG5e86d0c92 [2025-03-08 11:45:03,764 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:45:03,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i [2025-03-08 11:45:03,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110fa81b9/35c0f8c54daa4c0cb780aa555c888486/FLAG5e86d0c92 [2025-03-08 11:45:03,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110fa81b9/35c0f8c54daa4c0cb780aa555c888486 [2025-03-08 11:45:03,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:45:03,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:45:03,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:45:03,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:45:03,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:45:03,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:45:03" (1/1) ... [2025-03-08 11:45:03,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d5e064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:03, skipping insertion in model container [2025-03-08 11:45:03,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:45:03" (1/1) ... [2025-03-08 11:45:03,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:45:03,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i[919,932] [2025-03-08 11:45:03,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:45:03,995 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:45:04,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i[919,932] [2025-03-08 11:45:04,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:45:04,058 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:45:04,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04 WrapperNode [2025-03-08 11:45:04,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:45:04,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:45:04,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:45:04,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:45:04,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,106 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2025-03-08 11:45:04,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:45:04,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:45:04,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:45:04,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:45:04,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,150 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:45:04,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:45:04,180 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:45:04,181 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:45:04,181 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:45:04,182 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (1/1) ... [2025-03-08 11:45:04,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:45:04,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:45:04,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:45:04,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:45:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:45:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:45:04,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:45:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:45:04,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:45:04,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:45:04,298 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:45:04,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:45:04,637 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 11:45:04,638 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:45:04,657 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:45:04,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:45:04,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:45:04 BoogieIcfgContainer [2025-03-08 11:45:04,658 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:45:04,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:45:04,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:45:04,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:45:04,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:45:03" (1/3) ... [2025-03-08 11:45:04,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283f2f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:45:04, skipping insertion in model container [2025-03-08 11:45:04,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:04" (2/3) ... [2025-03-08 11:45:04,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283f2f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:45:04, skipping insertion in model container [2025-03-08 11:45:04,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:45:04" (3/3) ... [2025-03-08 11:45:04,665 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i [2025-03-08 11:45:04,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:45:04,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:45:04,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:45:04,740 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;@3d0fd85f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:45:04,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:45:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 11:45:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 11:45:04,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:04,756 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:04,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:04,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash -475446822, now seen corresponding path program 1 times [2025-03-08 11:45:04,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:04,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277633725] [2025-03-08 11:45:04,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:04,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:04,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 11:45:04,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 11:45:04,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:04,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-08 11:45:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277633725] [2025-03-08 11:45:05,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277633725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:45:05,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977461796] [2025-03-08 11:45:05,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:05,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:45:05,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:45:05,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:45:05,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:45:05,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 11:45:05,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 11:45:05,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:05,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:05,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:45:05,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-08 11:45:05,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:45:05,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977461796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:05,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:45:05,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:45:05,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59165965] [2025-03-08 11:45:05,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:05,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:45:05,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:05,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:45:05,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:45:05,292 INFO L87 Difference]: Start difference. First operand has 94 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 11:45:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:05,315 INFO L93 Difference]: Finished difference Result 182 states and 318 transitions. [2025-03-08 11:45:05,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:45:05,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2025-03-08 11:45:05,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:05,323 INFO L225 Difference]: With dead ends: 182 [2025-03-08 11:45:05,323 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 11:45:05,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:45:05,328 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:05,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:45:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 11:45:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 11:45:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 11:45:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2025-03-08 11:45:05,360 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 190 [2025-03-08 11:45:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:05,361 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2025-03-08 11:45:05,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 11:45:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2025-03-08 11:45:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 11:45:05,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:05,363 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:05,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:45:05,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:45:05,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash -613834179, now seen corresponding path program 1 times [2025-03-08 11:45:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217760737] [2025-03-08 11:45:05,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:05,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 11:45:05,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 11:45:05,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:05,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 11:45:05,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:05,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217760737] [2025-03-08 11:45:05,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217760737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:05,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:05,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:45:05,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614578193] [2025-03-08 11:45:05,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:05,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:45:05,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:05,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:45:05,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:45:05,904 INFO L87 Difference]: Start difference. First operand 91 states and 142 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:06,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:06,002 INFO L93 Difference]: Finished difference Result 267 states and 420 transitions. [2025-03-08 11:45:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:45:06,003 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-08 11:45:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:06,006 INFO L225 Difference]: With dead ends: 267 [2025-03-08 11:45:06,008 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 11:45:06,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:45:06,010 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 138 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:06,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 393 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:45:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 11:45:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 93. [2025-03-08 11:45:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 11:45:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 144 transitions. [2025-03-08 11:45:06,033 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 144 transitions. Word has length 190 [2025-03-08 11:45:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:06,034 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 144 transitions. [2025-03-08 11:45:06,034 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2025-03-08 11:45:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 11:45:06,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:06,039 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:06,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:45:06,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:06,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1458306050, now seen corresponding path program 1 times [2025-03-08 11:45:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:06,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805551709] [2025-03-08 11:45:06,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:06,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:06,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 11:45:06,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 11:45:06,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:06,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 11:45:06,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:06,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805551709] [2025-03-08 11:45:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805551709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:06,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:06,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:45:06,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908689164] [2025-03-08 11:45:06,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:06,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:45:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:06,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:45:06,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:45:06,399 INFO L87 Difference]: Start difference. First operand 93 states and 144 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:06,471 INFO L93 Difference]: Finished difference Result 273 states and 426 transitions. [2025-03-08 11:45:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:45:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-08 11:45:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:06,474 INFO L225 Difference]: With dead ends: 273 [2025-03-08 11:45:06,474 INFO L226 Difference]: Without dead ends: 183 [2025-03-08 11:45:06,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:45:06,475 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 80 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:06,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 298 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:45:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-08 11:45:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2025-03-08 11:45:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 11:45:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 279 transitions. [2025-03-08 11:45:06,504 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 279 transitions. Word has length 190 [2025-03-08 11:45:06,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:06,505 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 279 transitions. [2025-03-08 11:45:06,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 279 transitions. [2025-03-08 11:45:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 11:45:06,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:06,506 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:06,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:45:06,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:06,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:06,507 INFO L85 PathProgramCache]: Analyzing trace with hash -402483266, now seen corresponding path program 1 times [2025-03-08 11:45:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:06,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825230895] [2025-03-08 11:45:06,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:06,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 11:45:06,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 11:45:06,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:06,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 11:45:06,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:06,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825230895] [2025-03-08 11:45:06,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825230895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:06,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:06,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:45:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689539277] [2025-03-08 11:45:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:06,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:45:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:06,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:45:06,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:45:06,613 INFO L87 Difference]: Start difference. First operand 181 states and 279 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:06,643 INFO L93 Difference]: Finished difference Result 269 states and 412 transitions. [2025-03-08 11:45:06,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:45:06,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-08 11:45:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:06,646 INFO L225 Difference]: With dead ends: 269 [2025-03-08 11:45:06,648 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 11:45:06,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:45:06,649 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:06,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:45:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 11:45:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 11:45:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 11:45:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2025-03-08 11:45:06,666 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 190 [2025-03-08 11:45:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:06,666 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2025-03-08 11:45:06,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2025-03-08 11:45:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 11:45:06,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:06,669 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:06,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:45:06,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:06,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1833119229, now seen corresponding path program 1 times [2025-03-08 11:45:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345048405] [2025-03-08 11:45:06,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:06,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 11:45:06,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 11:45:06,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:06,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-08 11:45:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:06,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345048405] [2025-03-08 11:45:06,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345048405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:45:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434092598] [2025-03-08 11:45:06,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:06,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:45:06,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:45:06,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:45:06,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:45:07,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 11:45:07,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 11:45:07,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:07,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:07,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:45:07,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 534 proven. 15 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2025-03-08 11:45:07,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:45:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-08 11:45:07,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434092598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:45:07,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:45:07,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 11:45:07,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243024043] [2025-03-08 11:45:07,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:45:07,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:45:07,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:07,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:45:07,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:45:07,531 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2025-03-08 11:45:07,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:07,747 INFO L93 Difference]: Finished difference Result 185 states and 272 transitions. [2025-03-08 11:45:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:45:07,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 192 [2025-03-08 11:45:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:07,749 INFO L225 Difference]: With dead ends: 185 [2025-03-08 11:45:07,749 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 11:45:07,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:45:07,750 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 78 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:07,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 233 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:45:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 11:45:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-03-08 11:45:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 11:45:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-03-08 11:45:07,771 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 192 [2025-03-08 11:45:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:07,772 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-03-08 11:45:07,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2025-03-08 11:45:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-03-08 11:45:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 11:45:07,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:07,774 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:07,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:45:07,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:45:07,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:07,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2012381415, now seen corresponding path program 1 times [2025-03-08 11:45:07,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:07,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631503863] [2025-03-08 11:45:07,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:07,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 11:45:08,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 11:45:08,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:08,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 11:45:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631503863] [2025-03-08 11:45:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631503863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:08,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:08,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:45:08,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161908401] [2025-03-08 11:45:08,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:08,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:45:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:08,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:45:08,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:45:08,217 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:08,283 INFO L93 Difference]: Finished difference Result 192 states and 276 transitions. [2025-03-08 11:45:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:45:08,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2025-03-08 11:45:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:08,284 INFO L225 Difference]: With dead ends: 192 [2025-03-08 11:45:08,285 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 11:45:08,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:45:08,285 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 95 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:08,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 271 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:45:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 11:45:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 11:45:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 11:45:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2025-03-08 11:45:08,306 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 193 [2025-03-08 11:45:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:08,306 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2025-03-08 11:45:08,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2025-03-08 11:45:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 11:45:08,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:08,308 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:08,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:45:08,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:08,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1324884630, now seen corresponding path program 1 times [2025-03-08 11:45:08,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:08,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777722461] [2025-03-08 11:45:08,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:08,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:08,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 11:45:08,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 11:45:08,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:08,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 11:45:08,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:08,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777722461] [2025-03-08 11:45:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777722461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:08,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:08,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:45:08,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661465351] [2025-03-08 11:45:08,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:08,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:45:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:08,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:45:08,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:45:08,559 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:08,704 INFO L93 Difference]: Finished difference Result 333 states and 472 transitions. [2025-03-08 11:45:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:45:08,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-03-08 11:45:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:08,708 INFO L225 Difference]: With dead ends: 333 [2025-03-08 11:45:08,708 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 11:45:08,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:45:08,713 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 170 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:08,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 446 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:45:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 11:45:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2025-03-08 11:45:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 160 states have internal predecessors, (200), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 11:45:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 328 transitions. [2025-03-08 11:45:08,742 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 328 transitions. Word has length 194 [2025-03-08 11:45:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:08,742 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 328 transitions. [2025-03-08 11:45:08,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 328 transitions. [2025-03-08 11:45:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 11:45:08,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:08,744 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:08,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:45:08,744 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:08,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash 965421124, now seen corresponding path program 1 times [2025-03-08 11:45:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:08,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269635837] [2025-03-08 11:45:08,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:08,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 11:45:08,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 11:45:08,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:08,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:45:08,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:45:08,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 11:45:08,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 11:45:08,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:08,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:45:09,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:45:09,000 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:45:09,001 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:45:09,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:45:09,006 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:09,113 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:45:09,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:45:09 BoogieIcfgContainer [2025-03-08 11:45:09,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:45:09,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:45:09,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:45:09,115 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:45:09,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:45:04" (3/4) ... [2025-03-08 11:45:09,125 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:45:09,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:45:09,126 INFO L158 Benchmark]: Toolchain (without parser) took 5334.26ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 130.9MB in the beginning and 189.5MB in the end (delta: -58.6MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2025-03-08 11:45:09,127 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:45:09,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.94ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 114.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:45:09,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.18ms. Allocated memory is still 167.8MB. Free memory was 114.9MB in the beginning and 110.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:45:09,127 INFO L158 Benchmark]: Boogie Preprocessor took 70.85ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 103.5MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 11:45:09,127 INFO L158 Benchmark]: IcfgBuilder took 477.90ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 74.9MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 11:45:09,127 INFO L158 Benchmark]: TraceAbstraction took 4454.91ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 74.1MB in the beginning and 66.4MB in the end (delta: 7.7MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2025-03-08 11:45:09,127 INFO L158 Benchmark]: Witness Printer took 10.58ms. Allocated memory is still 226.5MB. Free memory was 66.4MB in the beginning and 189.5MB in the end (delta: -123.1MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2025-03-08 11:45:09,129 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.31ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.94ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 114.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.18ms. Allocated memory is still 167.8MB. Free memory was 114.9MB in the beginning and 110.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.85ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 103.5MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 477.90ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 74.9MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4454.91ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 74.1MB in the beginning and 66.4MB in the end (delta: 7.7MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. * Witness Printer took 10.58ms. Allocated memory is still 226.5MB. Free memory was 66.4MB in the beginning and 189.5MB in the end (delta: -123.1MB). Peak memory consumption was 8.6MB. 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 98, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 132, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] float var_1_24 = 9999999999.375; [L43] double var_1_28 = 9.25; [L44] double var_1_29 = 0.0; [L45] double var_1_30 = 127.6; [L46] unsigned long int var_1_32 = 128; [L47] unsigned long int var_1_34 = 1089279310; [L48] unsigned long int var_1_35 = 1307137784; [L49] unsigned long int var_1_36 = 1417807175; [L50] unsigned long int var_1_38 = 2; [L51] unsigned short int var_1_40 = 5; [L52] unsigned char var_1_44 = 5; [L53] unsigned char var_1_46 = 16; [L54] unsigned char last_1_var_1_10 = 200; VAL [isInitial=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_2=97/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L177] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_2=97/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L127] var_1_2 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L128] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L129] var_1_3 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L130] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L131] var_1_4 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L132] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L133] var_1_5 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L134] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L135] var_1_11 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L136] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L137] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L137] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L138] var_1_12 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L139] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L140] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L140] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L141] var_1_13 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && 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_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L142] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && 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_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L143] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L143] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L144] var_1_15 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && 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_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L145] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && 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_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L146] var_1_16 = __VERIFIER_nondet_float() [L147] 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_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L147] 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_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L148] var_1_17 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L149] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L152] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L152] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L153] var_1_21 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L154] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L155] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L155] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L156] var_1_23 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L157] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L158] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L158] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L159] var_1_29 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L160] RET assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L161] var_1_30 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L162] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L163] var_1_34 = __VERIFIER_nondet_ulong() [L164] CALL assume_abort_if_not(var_1_34 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L164] RET assume_abort_if_not(var_1_34 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L165] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L165] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L166] var_1_35 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_35 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L167] RET assume_abort_if_not(var_1_35 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L168] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L168] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L169] var_1_36 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_36 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L170] RET assume_abort_if_not(var_1_36 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L171] CALL assume_abort_if_not(var_1_36 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L171] RET assume_abort_if_not(var_1_36 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L172] var_1_46 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_46 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L173] RET assume_abort_if_not(var_1_46 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L174] CALL assume_abort_if_not(var_1_46 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L174] RET assume_abort_if_not(var_1_46 <= 127) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L188] RET updateVariables() [L189] CALL step() [L58] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L59] COND TRUE stepLocal_0 >= last_1_var_1_10 [L60] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L64] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L65] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L68] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L71] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L72] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L75] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L76] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L80] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L83] COND FALSE !(\read(var_1_19)) [L86] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L88] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L89] COND FALSE !(((var_1_15 - var_1_16) - var_1_17) <= var_1_13) [L92] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L95] EXPR var_1_10 & var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L95] COND TRUE (var_1_10 & var_1_12) >= -2 [L96] var_1_24 = var_1_16 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L98] var_1_28 = ((8.18603254193775E18 - (var_1_29 - var_1_30)) - var_1_16) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L99] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L102] EXPR var_1_35 | var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L102] COND TRUE (var_1_35 | var_1_10) > var_1_10 [L103] COND TRUE var_1_29 <= ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) [L104] var_1_38 = ((((var_1_18) < ((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) - var_1_36))) ? (var_1_18) : ((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) - var_1_36)))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2147483593, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L113] COND FALSE !((((((var_1_30 * var_1_13)) < (var_1_29)) ? ((var_1_30 * var_1_13)) : (var_1_29))) >= (- var_1_16)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2147483593, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L120] EXPR var_1_10 & var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2147483593, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L120] COND TRUE -32 < (var_1_10 & var_1_12) [L121] var_1_44 = ((((var_1_12) < ((var_1_46 + 10))) ? (var_1_12) : ((var_1_46 + 10)))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2147483593, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L189] RET step() [L190] CALL, EXPR property() [L180-L181] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2147483593, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2147483593, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=10000000004, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=-2147483649, var_1_38=2147483593, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 176 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 8, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 584 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 561 mSDsluCounter, 2038 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1028 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 392 IncrementalHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1010 mSDtfsCounter, 392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=7, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 95 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1915 NumberOfCodeBlocks, 1915 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1903 ConstructedInterpolants, 0 QuantifiedInterpolants, 3005 SizeOfPredicates, 3 NumberOfNonLiveVariables, 865 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 16139/16240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 11:45:09,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6ecf82a71a4459906964f052db8bbf04a27512c5e70ab06337f5d3d2ad3e980 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:45:11,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:45:11,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:45:11,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:45:11,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:45:11,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:45:11,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:45:11,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:45:11,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:45:11,186 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:45:11,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:45:11,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:45:11,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:45:11,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:45:11,186 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:45:11,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:45:11,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:45:11,188 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:45:11,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:45:11,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:45:11,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:45:11,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:45:11,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:45:11,189 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:45:11,189 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:45:11,189 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:45:11,189 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:45:11,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:45:11,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:45:11,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:45:11,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:45:11,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:45:11,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:45:11,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:45:11,191 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6ecf82a71a4459906964f052db8bbf04a27512c5e70ab06337f5d3d2ad3e980 [2025-03-08 11:45:11,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:45:11,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:45:11,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:45:11,451 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:45:11,451 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:45:11,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i [2025-03-08 11:45:12,631 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d904ba2ad/4caaab4d2238427ca70f11d59126e93e/FLAGc127ac2ea [2025-03-08 11:45:12,939 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:45:12,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i [2025-03-08 11:45:12,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d904ba2ad/4caaab4d2238427ca70f11d59126e93e/FLAGc127ac2ea [2025-03-08 11:45:12,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d904ba2ad/4caaab4d2238427ca70f11d59126e93e [2025-03-08 11:45:12,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:45:12,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:45:12,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:45:12,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:45:12,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:45:12,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:45:12" (1/1) ... [2025-03-08 11:45:12,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494fa0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:12, skipping insertion in model container [2025-03-08 11:45:12,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:45:12" (1/1) ... [2025-03-08 11:45:12,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:45:13,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i[919,932] [2025-03-08 11:45:13,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:45:13,144 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:45:13,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i[919,932] [2025-03-08 11:45:13,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:45:13,189 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:45:13,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13 WrapperNode [2025-03-08 11:45:13,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:45:13,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:45:13,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:45:13,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:45:13,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,228 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2025-03-08 11:45:13,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:45:13,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:45:13,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:45:13,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:45:13,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,247 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:45:13,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:45:13,272 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:45:13,272 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:45:13,272 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:45:13,273 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:45:13,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:45:13,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:45:13,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:45:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:45:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:45:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:45:13,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:45:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:45:13,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:45:13,382 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:45:13,384 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:45:46,707 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 11:45:46,707 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:45:46,714 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:45:46,715 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:45:46,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:45:46 BoogieIcfgContainer [2025-03-08 11:45:46,716 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:45:46,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:45:46,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:45:46,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:45:46,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:45:12" (1/3) ... [2025-03-08 11:45:46,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72276ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:45:46, skipping insertion in model container [2025-03-08 11:45:46,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13" (2/3) ... [2025-03-08 11:45:46,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72276ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:45:46, skipping insertion in model container [2025-03-08 11:45:46,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:45:46" (3/3) ... [2025-03-08 11:45:46,725 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i [2025-03-08 11:45:46,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:45:46,736 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-80.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:45:46,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:45:46,783 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;@451b2f17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:45:46,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:45:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 11:45:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:45:46,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:46,795 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:46,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:46,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1836592703, now seen corresponding path program 1 times [2025-03-08 11:45:46,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:45:46,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475826497] [2025-03-08 11:45:46,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:46,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:45:46,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:45:46,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:45:46,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 11:45:46,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:45:48,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:45:48,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:48,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:48,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:45:48,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-08 11:45:48,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:45:48,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:45:48,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475826497] [2025-03-08 11:45:48,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475826497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:48,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:48,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:45:48,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976076005] [2025-03-08 11:45:48,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:48,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:45:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:45:48,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:45:48,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:45:48,199 INFO L87 Difference]: Start difference. First operand has 85 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 11:45:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:48,224 INFO L93 Difference]: Finished difference Result 164 states and 288 transitions. [2025-03-08 11:45:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:45:48,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2025-03-08 11:45:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:48,229 INFO L225 Difference]: With dead ends: 164 [2025-03-08 11:45:48,230 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 11:45:48,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:45:48,234 INFO L435 NwaCegarLoop]: 125 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, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:48,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:45:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 11:45:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-08 11:45:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 11:45:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2025-03-08 11:45:48,273 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 187 [2025-03-08 11:45:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:48,273 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2025-03-08 11:45:48,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 11:45:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2025-03-08 11:45:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:45:48,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:48,277 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:45:48,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 11:45:48,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:45:48,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:48,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash 752550974, now seen corresponding path program 1 times [2025-03-08 11:45:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:45:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102808367] [2025-03-08 11:45:48,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:48,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:45:48,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:45:48,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:45:48,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 11:45:48,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:45:49,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:45:49,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:49,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:49,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 11:45:49,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 11:45:49,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:45:49,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:45:49,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102808367] [2025-03-08 11:45:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102808367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:49,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:45:49,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139507141] [2025-03-08 11:45:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:49,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:45:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:45:49,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:45:49,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:45:49,976 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:45:54,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:45:58,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:46:02,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:46:06,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:46:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:46:06,713 INFO L93 Difference]: Finished difference Result 240 states and 369 transitions. [2025-03-08 11:46:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:46:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-03-08 11:46:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:46:06,821 INFO L225 Difference]: With dead ends: 240 [2025-03-08 11:46:06,821 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 11:46:06,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:46:06,823 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 121 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:46:06,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 352 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2025-03-08 11:46:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 11:46:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 84. [2025-03-08 11:46:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 11:46:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 127 transitions. [2025-03-08 11:46:06,839 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 127 transitions. Word has length 187 [2025-03-08 11:46:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:46:06,841 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 127 transitions. [2025-03-08 11:46:06,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:46:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 127 transitions. [2025-03-08 11:46:06,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:46:06,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:46:06,843 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:46:06,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 11:46:07,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:46:07,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:46:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:46:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash 242016797, now seen corresponding path program 1 times [2025-03-08 11:46:07,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:46:07,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283835003] [2025-03-08 11:46:07,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:46:07,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:46:07,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:46:07,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:46:07,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 11:46:07,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:46:08,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:46:08,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:46:08,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:46:08,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 11:46:08,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:46:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 11:46:12,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:46:12,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:46:12,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283835003] [2025-03-08 11:46:12,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283835003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:46:12,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:46:12,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:46:12,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335045641] [2025-03-08 11:46:12,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:46:12,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:46:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:46:12,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:46:12,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:46:12,502 INFO L87 Difference]: Start difference. First operand 84 states and 127 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:46:17,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:46:21,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:46:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:46:21,045 INFO L93 Difference]: Finished difference Result 244 states and 371 transitions. [2025-03-08 11:46:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:46:21,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-03-08 11:46:21,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:46:21,168 INFO L225 Difference]: With dead ends: 244 [2025-03-08 11:46:21,168 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 11:46:21,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:46:21,169 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 27 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:46:21,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 250 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-03-08 11:46:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 11:46:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2025-03-08 11:46:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 100 states have (on average 1.25) internal successors, (125), 100 states have internal predecessors, (125), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 11:46:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 241 transitions. [2025-03-08 11:46:21,195 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 241 transitions. Word has length 187 [2025-03-08 11:46:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:46:21,195 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 241 transitions. [2025-03-08 11:46:21,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:46:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 241 transitions. [2025-03-08 11:46:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 11:46:21,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:46:21,197 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:46:21,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 11:46:21,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:46:21,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:46:21,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:46:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash -244521379, now seen corresponding path program 1 times [2025-03-08 11:46:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:46:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407077615] [2025-03-08 11:46:21,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:46:21,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:46:21,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:46:21,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:46:21,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 11:46:21,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 11:46:22,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 11:46:22,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:46:22,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:46:22,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 11:46:22,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:46:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 11:46:27,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:46:27,255 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:46:27,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407077615] [2025-03-08 11:46:27,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407077615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:46:27,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:46:27,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:46:27,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364560307] [2025-03-08 11:46:27,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:46:27,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:46:27,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:46:27,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:46:27,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:46:27,259 INFO L87 Difference]: Start difference. First operand 161 states and 241 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 11:46:32,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:46:36,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:46:40,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:46:44,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []