./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.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 44f3c78866341606a725ec4495ab49b41e658d35c89f21a87499e7ecc600588e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:54:10,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:54:10,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:54:10,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:54:10,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:54:10,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:54:10,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:54:10,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:54:10,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:54:10,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:54:10,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:54:10,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:54:10,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:54:10,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:54:10,773 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:54:10,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:54:10,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:54:10,773 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:54:10,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:54:10,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:54:10,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:54:10,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:54:10,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:54:10,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:54:10,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:54:10,775 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:54:10,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:54:10,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:54:10,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:54:10,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:54:10,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:54:10,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:54:10,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:54:10,775 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 -> 44f3c78866341606a725ec4495ab49b41e658d35c89f21a87499e7ecc600588e [2025-03-03 22:54:10,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:54:11,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:54:11,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:54:11,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:54:11,004 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:54:11,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i [2025-03-03 22:54:12,166 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1920353d8/5dc3f330397b4af9a31d9b912a2c0016/FLAG03342319d [2025-03-03 22:54:12,410 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:54:12,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i [2025-03-03 22:54:12,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1920353d8/5dc3f330397b4af9a31d9b912a2c0016/FLAG03342319d [2025-03-03 22:54:12,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1920353d8/5dc3f330397b4af9a31d9b912a2c0016 [2025-03-03 22:54:12,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:54:12,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:54:12,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:54:12,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:54:12,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:54:12,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e79afff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12, skipping insertion in model container [2025-03-03 22:54:12,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:54:12,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i[916,929] [2025-03-03 22:54:12,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:54:12,658 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:54:12,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i[916,929] [2025-03-03 22:54:12,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:54:12,729 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:54:12,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12 WrapperNode [2025-03-03 22:54:12,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:54:12,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:54:12,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:54:12,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:54:12,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,791 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 289 [2025-03-03 22:54:12,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:54:12,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:54:12,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:54:12,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:54:12,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,832 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:54:12,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:54:12,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:54:12,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:54:12,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:54:12,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (1/1) ... [2025-03-03 22:54:12,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:54:12,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:54:12,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:54:12,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:54:12,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:54:12,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:54:12,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:54:12,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:54:12,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:54:12,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:54:12,983 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:54:12,984 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:54:13,487 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: havoc property_#t~bitwise20#1;havoc property_#t~bitwise21#1;havoc property_#t~bitwise22#1;havoc property_#t~short23#1;havoc property_#t~bitwise24#1;havoc property_#t~ite27#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1; [2025-03-03 22:54:13,518 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-03 22:54:13,519 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:54:13,535 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:54:13,536 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:54:13,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:13 BoogieIcfgContainer [2025-03-03 22:54:13,536 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:54:13,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:54:13,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:54:13,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:54:13,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:54:12" (1/3) ... [2025-03-03 22:54:13,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e7f29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:13, skipping insertion in model container [2025-03-03 22:54:13,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:12" (2/3) ... [2025-03-03 22:54:13,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e7f29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:13, skipping insertion in model container [2025-03-03 22:54:13,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:13" (3/3) ... [2025-03-03 22:54:13,543 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-11.i [2025-03-03 22:54:13,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:54:13,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-11.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:54:13,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:54:13,615 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;@6e4cf814, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:54:13,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:54:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:54:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 22:54:13,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:13,630 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:13,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:13,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash 328363568, now seen corresponding path program 1 times [2025-03-03 22:54:13,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358126101] [2025-03-03 22:54:13,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:13,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 22:54:13,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 22:54:13,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:13,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:54:13,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:13,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358126101] [2025-03-03 22:54:13,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358126101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:54:13,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832559905] [2025-03-03 22:54:13,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:13,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:54:13,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:54:13,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:54:13,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:54:14,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 22:54:14,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 22:54:14,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:14,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:14,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:54:14,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:54:14,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:14,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832559905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:14,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:54:14,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:54:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593859868] [2025-03-03 22:54:14,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:14,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:54:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:14,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:54:14,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:54:14,158 INFO L87 Difference]: Start difference. First operand has 114 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:54:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:14,205 INFO L93 Difference]: Finished difference Result 222 states and 369 transitions. [2025-03-03 22:54:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:54:14,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2025-03-03 22:54:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:14,214 INFO L225 Difference]: With dead ends: 222 [2025-03-03 22:54:14,215 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 22:54:14,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:54:14,222 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:14,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:54:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 22:54:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-03 22:54:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 89 states have internal predecessors, (132), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:54:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2025-03-03 22:54:14,259 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 148 [2025-03-03 22:54:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:14,260 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2025-03-03 22:54:14,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:54:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2025-03-03 22:54:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 22:54:14,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:14,264 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:14,271 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-03 22:54:14,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:54:14,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1929275796, now seen corresponding path program 1 times [2025-03-03 22:54:14,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:14,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645072941] [2025-03-03 22:54:14,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:14,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:14,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 22:54:14,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 22:54:14,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:14,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:14,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:14,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645072941] [2025-03-03 22:54:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645072941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:54:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867592643] [2025-03-03 22:54:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:14,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:54:14,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:14,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:54:14,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:14,795 INFO L87 Difference]: Start difference. First operand 111 states and 172 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:14,860 INFO L93 Difference]: Finished difference Result 220 states and 343 transitions. [2025-03-03 22:54:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:54:14,860 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2025-03-03 22:54:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:14,862 INFO L225 Difference]: With dead ends: 220 [2025-03-03 22:54:14,862 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 22:54:14,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:14,863 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 4 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:14,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 468 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:54:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 22:54:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-03 22:54:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 90 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:54:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-03-03 22:54:14,872 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 148 [2025-03-03 22:54:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:14,874 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-03-03 22:54:14,874 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-03-03 22:54:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 22:54:14,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:14,875 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:14,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:54:14,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:14,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1875311964, now seen corresponding path program 1 times [2025-03-03 22:54:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325719103] [2025-03-03 22:54:14,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:14,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 22:54:15,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 22:54:15,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:15,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:15,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325719103] [2025-03-03 22:54:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325719103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:15,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:15,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:54:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155056166] [2025-03-03 22:54:15,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:15,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:54:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:15,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:54:15,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:54:15,506 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:15,977 INFO L93 Difference]: Finished difference Result 531 states and 821 transitions. [2025-03-03 22:54:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:54:15,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2025-03-03 22:54:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:15,981 INFO L225 Difference]: With dead ends: 531 [2025-03-03 22:54:15,983 INFO L226 Difference]: Without dead ends: 422 [2025-03-03 22:54:15,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:54:15,985 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 589 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:15,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 723 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:54:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-03 22:54:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 284. [2025-03-03 22:54:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 241 states have (on average 1.5269709543568464) internal successors, (368), 241 states have internal predecessors, (368), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:54:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 448 transitions. [2025-03-03 22:54:16,021 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 448 transitions. Word has length 149 [2025-03-03 22:54:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:16,023 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 448 transitions. [2025-03-03 22:54:16,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 448 transitions. [2025-03-03 22:54:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 22:54:16,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:16,026 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:16,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:54:16,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:16,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:16,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1488208061, now seen corresponding path program 1 times [2025-03-03 22:54:16,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:16,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936763887] [2025-03-03 22:54:16,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:16,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:16,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 22:54:16,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 22:54:16,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:16,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:16,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:16,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936763887] [2025-03-03 22:54:16,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936763887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:16,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:16,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:54:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616062621] [2025-03-03 22:54:16,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:16,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:54:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:16,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:54:16,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:16,417 INFO L87 Difference]: Start difference. First operand 284 states and 448 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:16,681 INFO L93 Difference]: Finished difference Result 800 states and 1261 transitions. [2025-03-03 22:54:16,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:54:16,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2025-03-03 22:54:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:16,686 INFO L225 Difference]: With dead ends: 800 [2025-03-03 22:54:16,688 INFO L226 Difference]: Without dead ends: 519 [2025-03-03 22:54:16,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-03 22:54:16,690 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 163 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:16,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 421 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:54:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-03 22:54:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 481. [2025-03-03 22:54:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 417 states have (on average 1.5299760191846523) internal successors, (638), 417 states have internal predecessors, (638), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 22:54:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 758 transitions. [2025-03-03 22:54:16,745 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 758 transitions. Word has length 150 [2025-03-03 22:54:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:16,746 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 758 transitions. [2025-03-03 22:54:16,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 758 transitions. [2025-03-03 22:54:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 22:54:16,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:16,748 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:16,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:54:16,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:16,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash 870308705, now seen corresponding path program 1 times [2025-03-03 22:54:16,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:16,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490335763] [2025-03-03 22:54:16,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:16,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:16,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 22:54:16,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 22:54:16,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:17,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:17,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490335763] [2025-03-03 22:54:17,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490335763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:17,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:54:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314355517] [2025-03-03 22:54:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:17,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:54:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:17,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:54:17,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:17,096 INFO L87 Difference]: Start difference. First operand 481 states and 758 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:17,338 INFO L93 Difference]: Finished difference Result 804 states and 1254 transitions. [2025-03-03 22:54:17,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:54:17,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2025-03-03 22:54:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:17,341 INFO L225 Difference]: With dead ends: 804 [2025-03-03 22:54:17,341 INFO L226 Difference]: Without dead ends: 437 [2025-03-03 22:54:17,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:54:17,344 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 137 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:17,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 429 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:54:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-03 22:54:17,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 417. [2025-03-03 22:54:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 353 states have (on average 1.5155807365439093) internal successors, (535), 353 states have internal predecessors, (535), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 22:54:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 655 transitions. [2025-03-03 22:54:17,395 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 655 transitions. Word has length 151 [2025-03-03 22:54:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:17,396 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 655 transitions. [2025-03-03 22:54:17,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 655 transitions. [2025-03-03 22:54:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 22:54:17,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:17,398 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:17,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:54:17,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:17,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:17,401 INFO L85 PathProgramCache]: Analyzing trace with hash 422310511, now seen corresponding path program 1 times [2025-03-03 22:54:17,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:17,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055649396] [2025-03-03 22:54:17,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:17,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:17,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 22:54:17,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 22:54:17,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:17,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:17,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:17,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055649396] [2025-03-03 22:54:17,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055649396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:17,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:17,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:54:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543237343] [2025-03-03 22:54:17,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:17,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:54:17,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:17,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:54:17,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:54:17,654 INFO L87 Difference]: Start difference. First operand 417 states and 655 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 22:54:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:18,071 INFO L93 Difference]: Finished difference Result 774 states and 1189 transitions. [2025-03-03 22:54:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:54:18,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 151 [2025-03-03 22:54:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:18,075 INFO L225 Difference]: With dead ends: 774 [2025-03-03 22:54:18,075 INFO L226 Difference]: Without dead ends: 630 [2025-03-03 22:54:18,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:54:18,077 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 683 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:18,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 792 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:54:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-03-03 22:54:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 582. [2025-03-03 22:54:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 491 states have (on average 1.4887983706720977) internal successors, (731), 491 states have internal predecessors, (731), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 22:54:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 891 transitions. [2025-03-03 22:54:18,118 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 891 transitions. Word has length 151 [2025-03-03 22:54:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:18,118 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 891 transitions. [2025-03-03 22:54:18,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 22:54:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 891 transitions. [2025-03-03 22:54:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 22:54:18,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:18,120 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:18,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:54:18,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:18,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash 633661424, now seen corresponding path program 1 times [2025-03-03 22:54:18,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:18,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359928389] [2025-03-03 22:54:18,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:18,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:18,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 22:54:18,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 22:54:18,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:18,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359928389] [2025-03-03 22:54:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359928389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:18,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:54:18,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857646449] [2025-03-03 22:54:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:18,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:54:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:18,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:54:18,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:54:18,399 INFO L87 Difference]: Start difference. First operand 582 states and 891 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:18,686 INFO L93 Difference]: Finished difference Result 1230 states and 1863 transitions. [2025-03-03 22:54:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:54:18,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2025-03-03 22:54:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:18,691 INFO L225 Difference]: With dead ends: 1230 [2025-03-03 22:54:18,691 INFO L226 Difference]: Without dead ends: 747 [2025-03-03 22:54:18,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:54:18,695 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 304 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:18,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 657 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:54:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-03 22:54:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 656. [2025-03-03 22:54:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 565 states have (on average 1.5008849557522124) internal successors, (848), 565 states have internal predecessors, (848), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 22:54:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1008 transitions. [2025-03-03 22:54:18,748 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1008 transitions. Word has length 151 [2025-03-03 22:54:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:18,749 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1008 transitions. [2025-03-03 22:54:18,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1008 transitions. [2025-03-03 22:54:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 22:54:18,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:18,750 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:18,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:54:18,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:18,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash 622345297, now seen corresponding path program 1 times [2025-03-03 22:54:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:18,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113913987] [2025-03-03 22:54:18,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:18,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:18,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 22:54:18,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 22:54:18,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:18,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113913987] [2025-03-03 22:54:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113913987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:18,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:18,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:54:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450990188] [2025-03-03 22:54:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:18,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:54:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:18,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:54:18,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:54:18,969 INFO L87 Difference]: Start difference. First operand 656 states and 1008 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:19,270 INFO L93 Difference]: Finished difference Result 1257 states and 1926 transitions. [2025-03-03 22:54:19,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:54:19,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2025-03-03 22:54:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:19,275 INFO L225 Difference]: With dead ends: 1257 [2025-03-03 22:54:19,276 INFO L226 Difference]: Without dead ends: 685 [2025-03-03 22:54:19,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:54:19,278 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 162 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:19,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 656 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:54:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-03 22:54:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 656. [2025-03-03 22:54:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 565 states have (on average 1.497345132743363) internal successors, (846), 565 states have internal predecessors, (846), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 22:54:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1006 transitions. [2025-03-03 22:54:19,317 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1006 transitions. Word has length 151 [2025-03-03 22:54:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:19,317 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1006 transitions. [2025-03-03 22:54:19,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1006 transitions. [2025-03-03 22:54:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 22:54:19,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:19,319 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:19,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:54:19,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:19,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:19,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1620594425, now seen corresponding path program 1 times [2025-03-03 22:54:19,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:19,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183614654] [2025-03-03 22:54:19,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:19,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:19,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 22:54:19,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 22:54:19,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:19,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:19,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:19,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183614654] [2025-03-03 22:54:19,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183614654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:19,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:19,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:54:19,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700188215] [2025-03-03 22:54:19,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:19,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:54:19,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:19,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:54:19,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:54:19,661 INFO L87 Difference]: Start difference. First operand 656 states and 1006 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:19,963 INFO L93 Difference]: Finished difference Result 1277 states and 1950 transitions. [2025-03-03 22:54:19,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:54:19,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2025-03-03 22:54:19,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:19,967 INFO L225 Difference]: With dead ends: 1277 [2025-03-03 22:54:19,967 INFO L226 Difference]: Without dead ends: 683 [2025-03-03 22:54:19,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:54:19,968 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 131 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:19,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 532 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:54:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-03 22:54:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 654. [2025-03-03 22:54:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 563 states have (on average 1.492007104795737) internal successors, (840), 563 states have internal predecessors, (840), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 22:54:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1000 transitions. [2025-03-03 22:54:20,013 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1000 transitions. Word has length 152 [2025-03-03 22:54:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:20,013 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 1000 transitions. [2025-03-03 22:54:20,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1000 transitions. [2025-03-03 22:54:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 22:54:20,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:20,015 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:20,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:54:20,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:20,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1276853350, now seen corresponding path program 1 times [2025-03-03 22:54:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728344208] [2025-03-03 22:54:20,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:20,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:20,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 22:54:20,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 22:54:20,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:20,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:20,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728344208] [2025-03-03 22:54:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728344208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:20,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:20,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:54:20,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665607051] [2025-03-03 22:54:20,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:20,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:54:20,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:20,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:54:20,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:20,321 INFO L87 Difference]: Start difference. First operand 654 states and 1000 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:20,642 INFO L93 Difference]: Finished difference Result 2095 states and 3228 transitions. [2025-03-03 22:54:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:54:20,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2025-03-03 22:54:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:20,649 INFO L225 Difference]: With dead ends: 2095 [2025-03-03 22:54:20,649 INFO L226 Difference]: Without dead ends: 1496 [2025-03-03 22:54:20,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-03 22:54:20,651 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 235 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:20,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 522 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:54:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-03-03 22:54:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1375. [2025-03-03 22:54:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1217 states have (on average 1.4930156121610518) internal successors, (1817), 1217 states have internal predecessors, (1817), 140 states have call successors, (140), 17 states have call predecessors, (140), 17 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 22:54:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2097 transitions. [2025-03-03 22:54:20,737 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2097 transitions. Word has length 152 [2025-03-03 22:54:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:20,738 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2097 transitions. [2025-03-03 22:54:20,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2097 transitions. [2025-03-03 22:54:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 22:54:20,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:20,740 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:20,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:54:20,740 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:20,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash -502361974, now seen corresponding path program 1 times [2025-03-03 22:54:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:20,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485074470] [2025-03-03 22:54:20,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:20,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:20,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 22:54:20,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 22:54:20,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:20,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:20,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:20,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485074470] [2025-03-03 22:54:20,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485074470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:20,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:20,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:54:20,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791098811] [2025-03-03 22:54:20,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:20,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:54:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:20,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:54:20,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:20,882 INFO L87 Difference]: Start difference. First operand 1375 states and 2097 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:21,133 INFO L93 Difference]: Finished difference Result 3547 states and 5441 transitions. [2025-03-03 22:54:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:54:21,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-03-03 22:54:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:21,142 INFO L225 Difference]: With dead ends: 3547 [2025-03-03 22:54:21,143 INFO L226 Difference]: Without dead ends: 2227 [2025-03-03 22:54:21,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-03 22:54:21,146 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 238 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:21,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 543 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:54:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2025-03-03 22:54:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2121. [2025-03-03 22:54:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1896 states have (on average 1.4910337552742616) internal successors, (2827), 1896 states have internal predecessors, (2827), 200 states have call successors, (200), 24 states have call predecessors, (200), 24 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-03 22:54:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3227 transitions. [2025-03-03 22:54:21,269 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3227 transitions. Word has length 154 [2025-03-03 22:54:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:21,270 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 3227 transitions. [2025-03-03 22:54:21,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3227 transitions. [2025-03-03 22:54:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 22:54:21,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:21,272 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:21,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 22:54:21,272 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:21,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash -216114994, now seen corresponding path program 1 times [2025-03-03 22:54:21,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:21,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285771702] [2025-03-03 22:54:21,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:21,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:21,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 22:54:21,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 22:54:21,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:21,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:21,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:21,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285771702] [2025-03-03 22:54:21,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285771702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:21,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:21,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:54:21,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275191879] [2025-03-03 22:54:21,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:21,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:54:21,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:21,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:54:21,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:21,472 INFO L87 Difference]: Start difference. First operand 2121 states and 3227 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:21,595 INFO L93 Difference]: Finished difference Result 4236 states and 6447 transitions. [2025-03-03 22:54:21,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:54:21,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-03-03 22:54:21,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:21,604 INFO L225 Difference]: With dead ends: 4236 [2025-03-03 22:54:21,605 INFO L226 Difference]: Without dead ends: 2171 [2025-03-03 22:54:21,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:21,609 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 2 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:21,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 473 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:54:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2025-03-03 22:54:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2171. [2025-03-03 22:54:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1946 states have (on average 1.4830421377183967) internal successors, (2886), 1946 states have internal predecessors, (2886), 200 states have call successors, (200), 24 states have call predecessors, (200), 24 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-03 22:54:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3286 transitions. [2025-03-03 22:54:21,731 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3286 transitions. Word has length 156 [2025-03-03 22:54:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:21,731 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 3286 transitions. [2025-03-03 22:54:21,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3286 transitions. [2025-03-03 22:54:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 22:54:21,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:21,734 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:21,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 22:54:21,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:21,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1509365903, now seen corresponding path program 1 times [2025-03-03 22:54:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:21,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772981374] [2025-03-03 22:54:21,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:21,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 22:54:21,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 22:54:21,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:21,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:54:21,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:54:21,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772981374] [2025-03-03 22:54:21,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772981374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:54:21,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138538607] [2025-03-03 22:54:21,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:21,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:54:21,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:54:21,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:54:21,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:54:22,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 22:54:22,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 22:54:22,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:22,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:22,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 22:54:22,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-03-03 22:54:22,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:54:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:54:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138538607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:54:22,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:54:22,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 22:54:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780972285] [2025-03-03 22:54:22,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:54:22,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:54:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:54:22,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:54:22,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:54:22,365 INFO L87 Difference]: Start difference. First operand 2171 states and 3286 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 22:54:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:22,641 INFO L93 Difference]: Finished difference Result 4330 states and 6521 transitions. [2025-03-03 22:54:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:54:22,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 156 [2025-03-03 22:54:22,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:22,653 INFO L225 Difference]: With dead ends: 4330 [2025-03-03 22:54:22,654 INFO L226 Difference]: Without dead ends: 2215 [2025-03-03 22:54:22,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:54:22,659 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 119 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:22,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 341 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:54:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2025-03-03 22:54:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2161. [2025-03-03 22:54:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 1926 states have (on average 1.4595015576323989) internal successors, (2811), 1926 states have internal predecessors, (2811), 200 states have call successors, (200), 34 states have call predecessors, (200), 34 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-03 22:54:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 3211 transitions. [2025-03-03 22:54:22,791 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 3211 transitions. Word has length 156 [2025-03-03 22:54:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:22,792 INFO L471 AbstractCegarLoop]: Abstraction has 2161 states and 3211 transitions. [2025-03-03 22:54:22,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 22:54:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 3211 transitions. [2025-03-03 22:54:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 22:54:22,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:22,794 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:22,801 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-03 22:54:22,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 22:54:22,995 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:22,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1924145521, now seen corresponding path program 1 times [2025-03-03 22:54:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:54:22,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270162930] [2025-03-03 22:54:22,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:54:23,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 22:54:23,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 22:54:23,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:23,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:54:23,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [589030118] [2025-03-03 22:54:23,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:23,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:54:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:54:23,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:54:23,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:54:23,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 22:54:23,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 22:54:23,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:23,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:54:23,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:54:23,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 22:54:23,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 22:54:23,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:23,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:54:23,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:54:23,438 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:54:23,439 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:54:23,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 22:54:23,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:54:23,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:23,734 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:54:23,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:54:23 BoogieIcfgContainer [2025-03-03 22:54:23,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:54:23,737 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:54:23,737 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:54:23,737 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:54:23,738 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:13" (3/4) ... [2025-03-03 22:54:23,739 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:54:23,740 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:54:23,741 INFO L158 Benchmark]: Toolchain (without parser) took 11307.69ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 155.0MB in the beginning and 145.8MB in the end (delta: 9.2MB). Peak memory consumption was 155.8MB. Max. memory is 16.1GB. [2025-03-03 22:54:23,741 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:54:23,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.79ms. Allocated memory is still 201.3MB. Free memory was 154.6MB in the beginning and 138.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:54:23,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.95ms. Allocated memory is still 201.3MB. Free memory was 138.6MB in the beginning and 132.4MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:54:23,741 INFO L158 Benchmark]: Boogie Preprocessor took 66.79ms. Allocated memory is still 201.3MB. Free memory was 132.4MB in the beginning and 124.9MB in the end (delta: 7.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:54:23,741 INFO L158 Benchmark]: IcfgBuilder took 674.54ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 83.2MB in the end (delta: 41.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 22:54:23,742 INFO L158 Benchmark]: TraceAbstraction took 10198.55ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 82.4MB in the beginning and 145.9MB in the end (delta: -63.5MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2025-03-03 22:54:23,742 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 352.3MB. Free memory was 145.9MB in the beginning and 145.8MB in the end (delta: 106.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:54:23,743 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.35ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.79ms. Allocated memory is still 201.3MB. Free memory was 154.6MB in the beginning and 138.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.95ms. Allocated memory is still 201.3MB. Free memory was 138.6MB in the beginning and 132.4MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.79ms. Allocated memory is still 201.3MB. Free memory was 132.4MB in the beginning and 124.9MB in the end (delta: 7.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 674.54ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 83.2MB in the end (delta: 41.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10198.55ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 82.4MB in the beginning and 145.9MB in the end (delta: -63.5MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 352.3MB. Free memory was 145.9MB in the beginning and 145.8MB in the end (delta: 106.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 61, overapproximation of bitwiseOr at line 189, overapproximation of bitwiseAnd at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.75; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_6 = -4; [L25] double var_1_7 = 49.8; [L26] double var_1_8 = 255.625; [L27] unsigned short int var_1_9 = 10; [L28] unsigned short int var_1_11 = 10000; [L29] signed char var_1_12 = 100; [L30] signed char var_1_13 = 16; [L31] unsigned long int var_1_14 = 4; [L32] signed short int var_1_15 = -16; [L33] unsigned char var_1_17 = 5; [L34] double var_1_18 = 64.75; [L35] double var_1_19 = 99.5; [L36] unsigned long int var_1_20 = 32; [L37] unsigned long int var_1_22 = 32; [L38] unsigned long int var_1_23 = 2461517415; [L39] unsigned long int var_1_24 = 1399914902; [L40] unsigned char var_1_25 = 2; [L41] signed long int var_1_26 = 4; [L42] unsigned char var_1_27 = 0; [L43] unsigned short int var_1_28 = 32; [L44] unsigned short int var_1_29 = 36457; [L45] double last_1_var_1_1 = 4.75; [L46] unsigned short int last_1_var_1_9 = 10; [L47] unsigned short int last_1_var_1_11 = 10000; [L48] unsigned long int last_1_var_1_14 = 4; [L49] signed short int last_1_var_1_15 = -16; [L50] unsigned char last_1_var_1_17 = 5; [L51] double last_1_var_1_18 = 64.75; [L52] unsigned long int last_1_var_1_20 = 32; [L53] unsigned long int last_1_var_1_22 = 32; [L54] unsigned char last_1_var_1_25 = 2; [L55] signed long int last_1_var_1_26 = 4; [L56] unsigned short int last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L175] last_1_var_1_1 = var_1_1 [L176] last_1_var_1_9 = var_1_9 [L177] last_1_var_1_11 = var_1_11 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_15 = var_1_15 [L180] last_1_var_1_17 = var_1_17 [L181] last_1_var_1_18 = var_1_18 [L182] last_1_var_1_20 = var_1_20 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_25 = var_1_25 [L185] last_1_var_1_26 = var_1_26 [L186] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L143] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L145] var_1_6 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L146] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L152] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L153] var_1_12 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L154] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L156] var_1_13 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L157] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L159] var_1_19 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L160] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L161] var_1_23 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L162] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L164] var_1_24 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_24 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L165] RET assume_abort_if_not(var_1_24 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L167] var_1_27 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L170] var_1_29 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L171] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L197] RET updateVariables() [L198] CALL step() [L60] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L60] signed long int stepLocal_0 = var_1_6 & 10000; [L61] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_0=10000, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L61] COND TRUE ((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < stepLocal_0 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L66] COND TRUE last_1_var_1_14 <= last_1_var_1_15 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L67] COND TRUE ((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13))) [L68] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L75] COND FALSE !(last_1_var_1_20 > last_1_var_1_15) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L80] COND TRUE last_1_var_1_14 <= 16 [L81] var_1_9 = last_1_var_1_25 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L84] unsigned long int stepLocal_5 = (3423867512u - var_1_13) - var_1_24; [L85] signed long int stepLocal_4 = 8; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] EXPR last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] COND TRUE stepLocal_4 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25)))) [L87] COND FALSE !(var_1_8 >= last_1_var_1_18) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] EXPR last_1_var_1_11 >> var_1_14 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] COND FALSE !(! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) [L98] signed char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_1=0, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L99] COND TRUE (var_1_9 + var_1_25) >= stepLocal_1 [L100] var_1_18 = ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L102] var_1_17 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L103] COND TRUE ! var_1_2 [L104] var_1_22 = (var_1_23 - var_1_25) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L108] COND TRUE var_1_7 >= 4.5 [L109] var_1_15 = (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L111] var_1_28 = (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) [L112] unsigned long int stepLocal_3 = var_1_22; [L113] signed char stepLocal_2 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_2=0, stepLocal_3=2147483645, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L114] COND TRUE stepLocal_2 == (var_1_6 * (var_1_12 - 64)) [L115] var_1_20 = var_1_17 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=2147483645, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L125] unsigned long int stepLocal_7 = var_1_14; [L126] unsigned long int stepLocal_6 = var_1_23; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=2147483645, stepLocal_5=2350125689, stepLocal_6=2147483647, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L127] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=2147483645, stepLocal_5=2350125689, stepLocal_6=2147483647, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR (((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR ((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189-L190] return ((((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13)))) && (var_1_2 ? ((var_1_23 >= var_1_25) ? (((var_1_25 - 10) <= var_1_14) ? (var_1_27 ? (var_1_26 == ((signed long int) (((((((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) < (var_1_17)) ? (((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) : (var_1_17))) + var_1_17))) : 1) : (var_1_26 == ((signed long int) ((((var_1_12) < (var_1_17)) ? (var_1_12) : (var_1_17)))))) : (var_1_26 == ((signed long int) ((-32 + var_1_22) + var_1_14)))) : 1)) && (var_1_28 == ((unsigned short int) (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 14, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2769 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2767 mSDsluCounter, 6719 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4484 mSDsCounter, 716 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1557 IncrementalHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 716 mSolverCounterUnsat, 2235 mSDtfsCounter, 1557 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2171occurred in iteration=12, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 674 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2589 NumberOfCodeBlocks, 2589 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2413 ConstructedInterpolants, 0 QuantifiedInterpolants, 8892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 818 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 11987/12160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:54:23,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.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 44f3c78866341606a725ec4495ab49b41e658d35c89f21a87499e7ecc600588e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:54:25,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:54:25,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:54:25,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:54:25,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:54:25,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:54:25,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:54:25,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:54:25,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:54:25,786 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:54:25,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:54:25,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:54:25,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:54:25,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:54:25,786 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:54:25,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:54:25,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:54:25,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:54:25,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:54:25,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:54:25,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:54:25,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:54:25,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:54:25,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:54:25,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:54:25,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:54:25,791 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:54:25,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:54:25,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:54:25,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:54:25,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:54:25,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:54:25,791 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 -> 44f3c78866341606a725ec4495ab49b41e658d35c89f21a87499e7ecc600588e [2025-03-03 22:54:26,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:54:26,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:54:26,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:54:26,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:54:26,046 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:54:26,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i [2025-03-03 22:54:27,266 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61590f91/007668b2ef67425481fcc5f9463be635/FLAGaf58d6fd7 [2025-03-03 22:54:27,471 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:54:27,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i [2025-03-03 22:54:27,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61590f91/007668b2ef67425481fcc5f9463be635/FLAGaf58d6fd7 [2025-03-03 22:54:27,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61590f91/007668b2ef67425481fcc5f9463be635 [2025-03-03 22:54:27,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:54:27,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:54:27,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:54:27,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:54:27,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:54:27,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1205a7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27, skipping insertion in model container [2025-03-03 22:54:27,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:54:27,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i[916,929] [2025-03-03 22:54:27,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:54:27,725 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:54:27,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i[916,929] [2025-03-03 22:54:27,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:54:27,804 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:54:27,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27 WrapperNode [2025-03-03 22:54:27,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:54:27,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:54:27,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:54:27,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:54:27,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,855 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2025-03-03 22:54:27,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:54:27,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:54:27,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:54:27,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:54:27,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,883 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:54:27,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:54:27,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:54:27,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:54:27,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:54:27,921 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (1/1) ... [2025-03-03 22:54:27,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:54:27,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:54:27,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:54:27,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:54:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:54:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:54:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:54:27,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:54:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:54:27,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:54:28,048 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:54:28,049 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:54:34,777 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 22:54:34,778 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:54:34,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:54:34,785 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:54:34,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:34 BoogieIcfgContainer [2025-03-03 22:54:34,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:54:34,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:54:34,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:54:34,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:54:34,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:54:27" (1/3) ... [2025-03-03 22:54:34,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755df28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:34, skipping insertion in model container [2025-03-03 22:54:34,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:27" (2/3) ... [2025-03-03 22:54:34,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755df28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:34, skipping insertion in model container [2025-03-03 22:54:34,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:34" (3/3) ... [2025-03-03 22:54:34,794 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-11.i [2025-03-03 22:54:34,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:54:34,807 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-11.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:54:34,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:54:34,861 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;@562ed3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:54:34,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:54:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:54:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 22:54:34,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:34,872 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:34,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:34,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1789745345, now seen corresponding path program 1 times [2025-03-03 22:54:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129048363] [2025-03-03 22:54:34,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:34,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:54:34,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:34,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:54:34,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:54:34,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 22:54:35,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 22:54:35,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:35,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:35,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:54:35,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-03 22:54:35,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:35,305 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:54:35,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129048363] [2025-03-03 22:54:35,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129048363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:35,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:35,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:54:35,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151348485] [2025-03-03 22:54:35,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:35,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:54:35,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:54:35,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:54:35,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:54:35,324 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:54:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:35,340 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2025-03-03 22:54:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:54:35,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2025-03-03 22:54:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:35,346 INFO L225 Difference]: With dead ends: 142 [2025-03-03 22:54:35,346 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 22:54:35,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:54:35,353 INFO L435 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:35,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:54:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 22:54:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 22:54:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:54:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2025-03-03 22:54:35,381 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 136 [2025-03-03 22:54:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:35,381 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2025-03-03 22:54:35,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:54:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2025-03-03 22:54:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 22:54:35,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:35,383 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:35,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:54:35,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:54:35,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:35,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1206864251, now seen corresponding path program 1 times [2025-03-03 22:54:35,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:35,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910626572] [2025-03-03 22:54:35,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:35,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:54:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:35,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:54:35,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:54:35,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 22:54:35,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 22:54:35,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:35,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:35,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:54:35,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:38,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:38,213 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:54:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910626572] [2025-03-03 22:54:38,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910626572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:38,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:38,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:54:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429158743] [2025-03-03 22:54:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:38,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:54:38,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:54:38,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:54:38,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:38,215 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:42,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:54:45,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:54:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:45,619 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2025-03-03 22:54:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:54:45,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-03-03 22:54:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:45,653 INFO L225 Difference]: With dead ends: 208 [2025-03-03 22:54:45,653 INFO L226 Difference]: Without dead ends: 140 [2025-03-03 22:54:45,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:54:45,654 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 69 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:45,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 292 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-03-03 22:54:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-03 22:54:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2025-03-03 22:54:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:54:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 174 transitions. [2025-03-03 22:54:45,674 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 174 transitions. Word has length 136 [2025-03-03 22:54:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:45,675 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 174 transitions. [2025-03-03 22:54:45,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 174 transitions. [2025-03-03 22:54:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 22:54:45,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:45,676 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:45,688 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-03 22:54:45,876 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-03 22:54:45,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1917575217, now seen corresponding path program 1 times [2025-03-03 22:54:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713964768] [2025-03-03 22:54:45,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:45,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:54:45,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:45,880 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-03 22:54:45,880 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-03 22:54:45,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 22:54:46,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 22:54:46,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:46,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:46,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:54:46,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:47,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:47,924 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:54:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713964768] [2025-03-03 22:54:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713964768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:47,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:47,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:54:47,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625076137] [2025-03-03 22:54:47,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:47,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:54:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:54:47,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:54:47,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:54:47,925 INFO L87 Difference]: Start difference. First operand 113 states and 174 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:49,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:54:51,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:54:53,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:54:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:54:53,621 INFO L93 Difference]: Finished difference Result 264 states and 409 transitions. [2025-03-03 22:54:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:54:53,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 22:54:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:54:53,625 INFO L225 Difference]: With dead ends: 264 [2025-03-03 22:54:53,626 INFO L226 Difference]: Without dead ends: 196 [2025-03-03 22:54:53,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:54:53,627 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 107 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:54:53,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 324 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-03 22:54:53,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-03 22:54:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 177. [2025-03-03 22:54:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 22:54:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 274 transitions. [2025-03-03 22:54:53,647 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 274 transitions. Word has length 137 [2025-03-03 22:54:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:54:53,648 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 274 transitions. [2025-03-03 22:54:53,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 274 transitions. [2025-03-03 22:54:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 22:54:53,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:54:53,649 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:54:53,665 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-03 22:54:53,850 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-03 22:54:53,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:54:53,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:54:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash -208028176, now seen corresponding path program 1 times [2025-03-03 22:54:53,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:54:53,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920689554] [2025-03-03 22:54:53,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:54:53,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:54:53,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:54:53,854 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-03 22:54:53,856 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-03 22:54:53,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 22:54:54,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 22:54:54,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:54:54,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:54:54,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:54:54,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:54:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:54:54,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:54:54,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:54:54,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920689554] [2025-03-03 22:54:54,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920689554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:54:54,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:54:54,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:54:54,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454448464] [2025-03-03 22:54:54,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:54:54,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:54:54,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:54:54,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:54:54,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:54:54,953 INFO L87 Difference]: Start difference. First operand 177 states and 274 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:54:59,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:02,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:04,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:04,272 INFO L93 Difference]: Finished difference Result 482 states and 753 transitions. [2025-03-03 22:55:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:55:04,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 22:55:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:04,310 INFO L225 Difference]: With dead ends: 482 [2025-03-03 22:55:04,310 INFO L226 Difference]: Without dead ends: 350 [2025-03-03 22:55:04,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:55:04,313 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 143 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:04,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 337 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 1 Unknown, 0 Unchecked, 9.2s Time] [2025-03-03 22:55:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-03 22:55:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 307. [2025-03-03 22:55:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 201 states have internal predecessors, (279), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 22:55:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 479 transitions. [2025-03-03 22:55:04,362 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 479 transitions. Word has length 137 [2025-03-03 22:55:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:04,362 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 479 transitions. [2025-03-03 22:55:04,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:55:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 479 transitions. [2025-03-03 22:55:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 22:55:04,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:04,364 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:55:04,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-03 22:55:04,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:55:04,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:04,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash 906162556, now seen corresponding path program 1 times [2025-03-03 22:55:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:55:04,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696241256] [2025-03-03 22:55:04,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:04,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:55:04,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:55:04,568 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:55:04,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 22:55:04,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 22:55:04,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 22:55:04,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:04,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:04,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:55:04,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:55:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-03 22:55:06,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:55:07,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:55:07,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696241256] [2025-03-03 22:55:07,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696241256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:55:07,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [945143200] [2025-03-03 22:55:07,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:07,546 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:55:07,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:55:07,548 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:55:07,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-03 22:55:07,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 22:55:08,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 22:55:08,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:08,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:08,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 22:55:08,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:55:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:55:11,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:55:11,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [945143200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:55:11,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:55:11,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-03 22:55:11,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576130911] [2025-03-03 22:55:11,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:55:11,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:55:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:55:11,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:55:11,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:55:11,864 INFO L87 Difference]: Start difference. First operand 307 states and 479 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:55:16,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 22:55:21,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 22:55:22,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 22:55:26,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 22:55:31,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:55:33,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 22:55:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:55:34,864 INFO L93 Difference]: Finished difference Result 921 states and 1426 transitions. [2025-03-03 22:55:34,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:55:34,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-03-03 22:55:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:55:34,875 INFO L225 Difference]: With dead ends: 921 [2025-03-03 22:55:34,875 INFO L226 Difference]: Without dead ends: 659 [2025-03-03 22:55:34,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:55:34,878 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 321 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 100 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:55:34,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 429 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 270 Invalid, 2 Unknown, 0 Unchecked, 22.3s Time] [2025-03-03 22:55:34,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-03 22:55:34,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 527. [2025-03-03 22:55:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 359 states have (on average 1.4011142061281336) internal successors, (503), 361 states have internal predecessors, (503), 158 states have call successors, (158), 9 states have call predecessors, (158), 9 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-03 22:55:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 819 transitions. [2025-03-03 22:55:34,942 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 819 transitions. Word has length 138 [2025-03-03 22:55:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:55:34,944 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 819 transitions. [2025-03-03 22:55:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:55:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 819 transitions. [2025-03-03 22:55:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 22:55:34,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:55:34,947 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:55:34,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-03 22:55:35,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-03 22:55:35,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:55:35,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:55:35,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:55:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash 400603931, now seen corresponding path program 1 times [2025-03-03 22:55:35,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:55:35,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961871897] [2025-03-03 22:55:35,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:55:35,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:55:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:55:35,351 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:55:35,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-03 22:55:35,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 22:55:35,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 22:55:35,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:55:35,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:55:35,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 22:55:35,714 INFO L279 TraceCheckSpWp]: Computing forward predicates...