./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.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 a2084c791d87550f3d94f8de030a033d2f092b886e9479453044cdf29085c5fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:23:41,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:23:41,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:23:41,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:23:41,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:23:41,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:23:41,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:23:41,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:23:41,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:23:41,421 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:23:41,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:23:41,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:23:41,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:23:41,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:23:41,422 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:23:41,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:23:41,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:23:41,422 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:23:41,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:23:41,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:23:41,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:23:41,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:23:41,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:23:41,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:23:41,423 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:23:41,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:23:41,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:23:41,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:23:41,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:23:41,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:23:41,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:23:41,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:23:41,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:23:41,425 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 -> a2084c791d87550f3d94f8de030a033d2f092b886e9479453044cdf29085c5fe [2025-03-17 01:23:41,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:23:41,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:23:41,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:23:41,649 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:23:41,649 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:23:41,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2025-03-17 01:23:42,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e575d48b/93658bf50c1e4d9dbfde74ffe34d5bef/FLAG89f9ed0a6 [2025-03-17 01:23:43,005 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:23:43,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2025-03-17 01:23:43,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e575d48b/93658bf50c1e4d9dbfde74ffe34d5bef/FLAG89f9ed0a6 [2025-03-17 01:23:43,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e575d48b/93658bf50c1e4d9dbfde74ffe34d5bef [2025-03-17 01:23:43,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:23:43,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:23:43,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:23:43,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:23:43,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:23:43,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a876983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43, skipping insertion in model container [2025-03-17 01:23:43,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:23:43,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i[919,932] [2025-03-17 01:23:43,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:23:43,523 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:23:43,531 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i[919,932] [2025-03-17 01:23:43,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:23:43,593 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:23:43,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43 WrapperNode [2025-03-17 01:23:43,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:23:43,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:23:43,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:23:43,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:23:43,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,630 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2025-03-17 01:23:43,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:23:43,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:23:43,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:23:43,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:23:43,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,646 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-17 01:23:43,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,654 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:23:43,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:23:43,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:23:43,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:23:43,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (1/1) ... [2025-03-17 01:23:43,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:23:43,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:43,688 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-17 01:23:43,690 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-17 01:23:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:23:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:23:43,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:23:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:23:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:23:43,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:23:43,778 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:23:43,779 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:23:44,082 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 01:23:44,082 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:23:44,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:23:44,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:23:44,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:23:44 BoogieIcfgContainer [2025-03-17 01:23:44,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:23:44,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:23:44,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:23:44,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:23:44,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:23:43" (1/3) ... [2025-03-17 01:23:44,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0e1683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:23:44, skipping insertion in model container [2025-03-17 01:23:44,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:23:43" (2/3) ... [2025-03-17 01:23:44,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0e1683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:23:44, skipping insertion in model container [2025-03-17 01:23:44,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:23:44" (3/3) ... [2025-03-17 01:23:44,104 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2025-03-17 01:23:44,113 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:23:44,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:23:44,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:23:44,161 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;@21b74d10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:23:44,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:23:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:23:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 01:23:44,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:44,177 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:23:44,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:44,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash 710750771, now seen corresponding path program 1 times [2025-03-17 01:23:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:44,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326921117] [2025-03-17 01:23:44,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:44,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:44,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 01:23:44,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 01:23:44,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:44,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-17 01:23:44,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:44,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326921117] [2025-03-17 01:23:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326921117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687490375] [2025-03-17 01:23:44,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:44,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:44,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:44,480 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-17 01:23:44,481 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-17 01:23:44,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 01:23:44,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 01:23:44,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:44,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:44,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:23:44,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-17 01:23:44,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:23:44,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687490375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:44,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:23:44,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:23:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594899396] [2025-03-17 01:23:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:44,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:23:44,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:44,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:23:44,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:23:44,717 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 01:23:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:44,737 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2025-03-17 01:23:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:23:44,738 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, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2025-03-17 01:23:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:44,742 INFO L225 Difference]: With dead ends: 172 [2025-03-17 01:23:44,742 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 01:23:44,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 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-17 01:23:44,746 INFO L435 NwaCegarLoop]: 135 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, 135 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-17 01:23:44,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:23:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 01:23:44,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 01:23:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:23:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2025-03-17 01:23:44,775 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 198 [2025-03-17 01:23:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:44,775 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2025-03-17 01:23:44,776 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, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 01:23:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2025-03-17 01:23:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 01:23:44,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:44,780 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:23:44,786 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-17 01:23:44,980 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-17 01:23:44,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:44,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1867822571, now seen corresponding path program 1 times [2025-03-17 01:23:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844780024] [2025-03-17 01:23:44,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:45,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 01:23:45,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 01:23:45,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:45,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 01:23:45,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:45,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844780024] [2025-03-17 01:23:45,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844780024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:45,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:45,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:23:45,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113295793] [2025-03-17 01:23:45,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:45,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:23:45,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:45,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:23:45,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:23:45,457 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 01:23:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:45,630 INFO L93 Difference]: Finished difference Result 254 states and 404 transitions. [2025-03-17 01:23:45,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:23:45,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-03-17 01:23:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:45,634 INFO L225 Difference]: With dead ends: 254 [2025-03-17 01:23:45,634 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 01:23:45,634 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-17 01:23:45,635 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 95 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:45,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 383 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:23:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 01:23:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 141. [2025-03-17 01:23:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 01:23:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 222 transitions. [2025-03-17 01:23:45,662 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 222 transitions. Word has length 198 [2025-03-17 01:23:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:45,662 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 222 transitions. [2025-03-17 01:23:45,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 01:23:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 222 transitions. [2025-03-17 01:23:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-17 01:23:45,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:45,664 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:23:45,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:23:45,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:45,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1867263641, now seen corresponding path program 1 times [2025-03-17 01:23:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:45,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842765260] [2025-03-17 01:23:45,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:45,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:45,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 01:23:45,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 01:23:45,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:45,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 01:23:46,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:46,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842765260] [2025-03-17 01:23:46,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842765260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:46,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:46,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:23:46,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242045437] [2025-03-17 01:23:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:46,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:23:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:46,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:23:46,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:23:46,050 INFO L87 Difference]: Start difference. First operand 141 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 01:23:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:46,293 INFO L93 Difference]: Finished difference Result 316 states and 498 transitions. [2025-03-17 01:23:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:23:46,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2025-03-17 01:23:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:46,296 INFO L225 Difference]: With dead ends: 316 [2025-03-17 01:23:46,296 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 01:23:46,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:23:46,297 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 115 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:46,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 462 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:23:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 01:23:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2025-03-17 01:23:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 123 states have internal predecessors, (162), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:23:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 354 transitions. [2025-03-17 01:23:46,337 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 354 transitions. Word has length 199 [2025-03-17 01:23:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:46,337 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 354 transitions. [2025-03-17 01:23:46,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 01:23:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 354 transitions. [2025-03-17 01:23:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 01:23:46,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:46,339 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:23:46,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:23:46,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:46,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash -851168107, now seen corresponding path program 1 times [2025-03-17 01:23:46,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:46,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623614408] [2025-03-17 01:23:46,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:46,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:46,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 01:23:46,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 01:23:46,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:46,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 01:23:46,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:46,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623614408] [2025-03-17 01:23:46,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623614408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:46,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:46,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:23:46,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203936323] [2025-03-17 01:23:46,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:46,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:23:46,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:46,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:23:46,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:23:46,541 INFO L87 Difference]: Start difference. First operand 223 states and 354 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 01:23:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:46,753 INFO L93 Difference]: Finished difference Result 555 states and 886 transitions. [2025-03-17 01:23:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:23:46,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 200 [2025-03-17 01:23:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:46,759 INFO L225 Difference]: With dead ends: 555 [2025-03-17 01:23:46,759 INFO L226 Difference]: Without dead ends: 389 [2025-03-17 01:23:46,760 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-17 01:23:46,761 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 110 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:46,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 356 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:23:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-17 01:23:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2025-03-17 01:23:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 221 states have (on average 1.3438914027149322) internal successors, (297), 221 states have internal predecessors, (297), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-17 01:23:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 617 transitions. [2025-03-17 01:23:46,825 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 617 transitions. Word has length 200 [2025-03-17 01:23:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:46,826 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 617 transitions. [2025-03-17 01:23:46,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 01:23:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 617 transitions. [2025-03-17 01:23:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 01:23:46,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:46,828 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:23:46,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:23:46,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:46,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:46,829 INFO L85 PathProgramCache]: Analyzing trace with hash 656383702, now seen corresponding path program 1 times [2025-03-17 01:23:46,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:46,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209621668] [2025-03-17 01:23:46,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:46,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 01:23:46,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 01:23:46,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:46,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 01:23:47,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:47,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209621668] [2025-03-17 01:23:47,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209621668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:23:47,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:23:47,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:23:47,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869422276] [2025-03-17 01:23:47,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:23:47,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:23:47,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:47,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:23:47,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:23:47,006 INFO L87 Difference]: Start difference. First operand 387 states and 617 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 01:23:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:47,064 INFO L93 Difference]: Finished difference Result 736 states and 1179 transitions. [2025-03-17 01:23:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:23:47,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2025-03-17 01:23:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:47,068 INFO L225 Difference]: With dead ends: 736 [2025-03-17 01:23:47,070 INFO L226 Difference]: Without dead ends: 406 [2025-03-17 01:23:47,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:23:47,071 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 33 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 289 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-17 01:23:47,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 289 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:23:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-17 01:23:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 387. [2025-03-17 01:23:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 221 states have (on average 1.3257918552036199) internal successors, (293), 221 states have internal predecessors, (293), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-17 01:23:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 613 transitions. [2025-03-17 01:23:47,135 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 613 transitions. Word has length 200 [2025-03-17 01:23:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:47,136 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 613 transitions. [2025-03-17 01:23:47,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 01:23:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 613 transitions. [2025-03-17 01:23:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 01:23:47,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:47,138 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:23:47,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:23:47,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:47,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:47,139 INFO L85 PathProgramCache]: Analyzing trace with hash -591994488, now seen corresponding path program 1 times [2025-03-17 01:23:47,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:47,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739981155] [2025-03-17 01:23:47,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:47,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 01:23:47,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 01:23:47,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:47,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 01:23:47,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:47,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739981155] [2025-03-17 01:23:47,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739981155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:47,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725412989] [2025-03-17 01:23:47,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:47,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:47,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:47,381 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-17 01:23:47,383 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-17 01:23:47,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 01:23:47,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 01:23:47,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:47,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:47,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:23:47,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 783 proven. 69 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2025-03-17 01:23:47,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 01:23:47,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725412989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:23:47,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:23:47,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 01:23:47,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401632930] [2025-03-17 01:23:47,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:23:47,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:23:47,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:47,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:23:47,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:23:47,929 INFO L87 Difference]: Start difference. First operand 387 states and 613 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-03-17 01:23:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:48,143 INFO L93 Difference]: Finished difference Result 583 states and 902 transitions. [2025-03-17 01:23:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:23:48,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 201 [2025-03-17 01:23:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:48,147 INFO L225 Difference]: With dead ends: 583 [2025-03-17 01:23:48,148 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 01:23:48,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:23:48,151 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 144 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:48,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 198 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:23:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 01:23:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 235. [2025-03-17 01:23:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 132 states have (on average 1.2651515151515151) internal successors, (167), 132 states have internal predecessors, (167), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:23:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 359 transitions. [2025-03-17 01:23:48,191 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 359 transitions. Word has length 201 [2025-03-17 01:23:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:48,191 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 359 transitions. [2025-03-17 01:23:48,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-03-17 01:23:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 359 transitions. [2025-03-17 01:23:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 01:23:48,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:48,193 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:23:48,200 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-17 01:23:48,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 01:23:48,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:48,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:48,394 INFO L85 PathProgramCache]: Analyzing trace with hash 915557321, now seen corresponding path program 1 times [2025-03-17 01:23:48,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826898538] [2025-03-17 01:23:48,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:48,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 01:23:48,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 01:23:48,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:48,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 01:23:48,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826898538] [2025-03-17 01:23:48,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826898538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324424506] [2025-03-17 01:23:48,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:48,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:48,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:48,695 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-17 01:23:48,697 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-17 01:23:48,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 01:23:48,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 01:23:48,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:48,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:48,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 01:23:48,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2025-03-17 01:23:48,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 01:23:49,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324424506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:23:49,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:23:49,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2025-03-17 01:23:49,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177076277] [2025-03-17 01:23:49,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:23:49,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 01:23:49,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:49,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 01:23:49,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:23:49,217 INFO L87 Difference]: Start difference. First operand 235 states and 359 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-17 01:23:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:49,895 INFO L93 Difference]: Finished difference Result 643 states and 955 transitions. [2025-03-17 01:23:49,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 01:23:49,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 201 [2025-03-17 01:23:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:49,899 INFO L225 Difference]: With dead ends: 643 [2025-03-17 01:23:49,899 INFO L226 Difference]: Without dead ends: 469 [2025-03-17 01:23:49,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 399 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:23:49,901 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 264 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:49,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 597 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:23:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-17 01:23:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 345. [2025-03-17 01:23:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 201 states have (on average 1.2238805970149254) internal successors, (246), 203 states have internal predecessors, (246), 130 states have call successors, (130), 13 states have call predecessors, (130), 13 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-17 01:23:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 506 transitions. [2025-03-17 01:23:49,947 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 506 transitions. Word has length 201 [2025-03-17 01:23:49,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:49,948 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 506 transitions. [2025-03-17 01:23:49,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-17 01:23:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 506 transitions. [2025-03-17 01:23:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 01:23:49,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:49,949 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:23:49,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 01:23:50,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:50,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:50,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:50,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1408739412, now seen corresponding path program 1 times [2025-03-17 01:23:50,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:50,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002311345] [2025-03-17 01:23:50,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:50,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:50,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 01:23:50,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 01:23:50,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:50,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 36 proven. 57 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 01:23:50,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:50,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002311345] [2025-03-17 01:23:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002311345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:23:50,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481398681] [2025-03-17 01:23:50,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:50,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:50,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:50,545 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:23:50,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 01:23:50,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 01:23:50,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 01:23:50,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:50,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:50,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 01:23:50,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1050 proven. 123 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-03-17 01:23:51,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 57 proven. 126 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2025-03-17 01:23:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481398681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:23:52,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:23:52,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 20 [2025-03-17 01:23:52,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97187285] [2025-03-17 01:23:52,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:23:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 01:23:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:52,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 01:23:52,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-03-17 01:23:52,313 INFO L87 Difference]: Start difference. First operand 345 states and 506 transitions. Second operand has 20 states, 19 states have (on average 6.684210526315789) internal successors, (127), 20 states have internal predecessors, (127), 9 states have call successors, (80), 4 states have call predecessors, (80), 8 states have return successors, (80), 7 states have call predecessors, (80), 9 states have call successors, (80) [2025-03-17 01:23:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:52,707 INFO L93 Difference]: Finished difference Result 691 states and 974 transitions. [2025-03-17 01:23:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 01:23:52,708 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.684210526315789) internal successors, (127), 20 states have internal predecessors, (127), 9 states have call successors, (80), 4 states have call predecessors, (80), 8 states have return successors, (80), 7 states have call predecessors, (80), 9 states have call successors, (80) Word has length 203 [2025-03-17 01:23:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:52,713 INFO L225 Difference]: With dead ends: 691 [2025-03-17 01:23:52,713 INFO L226 Difference]: Without dead ends: 411 [2025-03-17 01:23:52,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=301, Invalid=569, Unknown=0, NotChecked=0, Total=870 [2025-03-17 01:23:52,714 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 161 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:52,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 299 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:23:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-17 01:23:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 385. [2025-03-17 01:23:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 231 states have (on average 1.1774891774891776) internal successors, (272), 233 states have internal predecessors, (272), 130 states have call successors, (130), 23 states have call predecessors, (130), 23 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-17 01:23:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 532 transitions. [2025-03-17 01:23:52,759 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 532 transitions. Word has length 203 [2025-03-17 01:23:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:52,759 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 532 transitions. [2025-03-17 01:23:52,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.684210526315789) internal successors, (127), 20 states have internal predecessors, (127), 9 states have call successors, (80), 4 states have call predecessors, (80), 8 states have return successors, (80), 7 states have call predecessors, (80), 9 states have call successors, (80) [2025-03-17 01:23:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 532 transitions. [2025-03-17 01:23:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 01:23:52,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:52,761 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:23:52,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 01:23:52,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:52,962 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:52,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:52,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1143417549, now seen corresponding path program 1 times [2025-03-17 01:23:52,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:52,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572148449] [2025-03-17 01:23:52,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:52,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:52,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 01:23:53,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 01:23:53,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:53,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:23:53,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144217581] [2025-03-17 01:23:53,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:53,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:53,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:53,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:23:53,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 01:23:53,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 01:23:53,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 01:23:53,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:53,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:23:53,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 01:23:53,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:23:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1457 proven. 87 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-17 01:23:53,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:23:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 78 proven. 15 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 01:23:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:23:54,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572148449] [2025-03-17 01:23:54,895 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 01:23:54,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144217581] [2025-03-17 01:23:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144217581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:23:54,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:23:54,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2025-03-17 01:23:54,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384847440] [2025-03-17 01:23:54,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:23:54,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 01:23:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:23:54,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 01:23:54,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2025-03-17 01:23:54,897 INFO L87 Difference]: Start difference. First operand 385 states and 532 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (52), 10 states have call predecessors, (52), 8 states have call successors, (52) [2025-03-17 01:23:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:23:56,310 INFO L93 Difference]: Finished difference Result 779 states and 1035 transitions. [2025-03-17 01:23:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 01:23:56,311 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (52), 10 states have call predecessors, (52), 8 states have call successors, (52) Word has length 203 [2025-03-17 01:23:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:23:56,314 INFO L225 Difference]: With dead ends: 779 [2025-03-17 01:23:56,314 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 01:23:56,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=639, Unknown=0, NotChecked=0, Total=930 [2025-03-17 01:23:56,318 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 133 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:23:56,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 461 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 01:23:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 01:23:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 429. [2025-03-17 01:23:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 264 states have (on average 1.1401515151515151) internal successors, (301), 266 states have internal predecessors, (301), 130 states have call successors, (130), 34 states have call predecessors, (130), 34 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-17 01:23:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 561 transitions. [2025-03-17 01:23:56,370 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 561 transitions. Word has length 203 [2025-03-17 01:23:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:23:56,370 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 561 transitions. [2025-03-17 01:23:56,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (52), 10 states have call predecessors, (52), 8 states have call successors, (52) [2025-03-17 01:23:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 561 transitions. [2025-03-17 01:23:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 01:23:56,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:23:56,373 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:23:56,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 01:23:56,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:56,574 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:23:56,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:23:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1143447340, now seen corresponding path program 1 times [2025-03-17 01:23:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:23:56,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318719160] [2025-03-17 01:23:56,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:56,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:23:56,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 01:23:56,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 01:23:56,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:56,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:23:56,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556467522] [2025-03-17 01:23:56,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:23:56,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:56,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:23:56,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:23:56,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 01:23:56,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 01:23:56,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 01:23:56,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:56,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:23:56,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:23:56,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 01:23:56,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 01:23:56,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:23:56,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:23:56,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:23:56,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:23:56,917 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:23:56,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 01:23:57,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:23:57,122 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:23:57,215 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:23:57,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:23:57 BoogieIcfgContainer [2025-03-17 01:23:57,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:23:57,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:23:57,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:23:57,218 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:23:57,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:23:44" (3/4) ... [2025-03-17 01:23:57,220 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:23:57,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:23:57,221 INFO L158 Benchmark]: Toolchain (without parser) took 13889.13ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 132.1MB in the beginning and 115.4MB in the end (delta: 16.7MB). Peak memory consumption was 154.8MB. Max. memory is 16.1GB. [2025-03-17 01:23:57,222 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:23:57,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.74ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 116.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:23:57,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.84ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 113.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:23:57,223 INFO L158 Benchmark]: Boogie Preprocessor took 32.19ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 109.6MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:23:57,223 INFO L158 Benchmark]: IcfgBuilder took 432.20ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 84.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 01:23:57,223 INFO L158 Benchmark]: TraceAbstraction took 13119.32ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 84.4MB in the beginning and 115.4MB in the end (delta: -31.0MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2025-03-17 01:23:57,223 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 302.0MB. Free memory was 115.4MB in the beginning and 115.4MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:23:57,224 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.88ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.74ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 116.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.84ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 113.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.19ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 109.6MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 432.20ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 84.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13119.32ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 84.4MB in the beginning and 115.4MB in the end (delta: -31.0MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 302.0MB. Free memory was 115.4MB in the beginning and 115.4MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of someBinaryFLOATComparisonOperation at line 190, overapproximation of someBinaryFLOATComparisonOperation at line 194, overapproximation of someUnaryDOUBLEoperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 171, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 206, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] float var_1_25 = -0.575; [L41] signed char var_1_27 = 5; [L42] signed char var_1_28 = 1; [L43] float var_1_30 = 10.8; [L44] float var_1_31 = 49.2; [L45] float var_1_32 = 0.4; [L46] unsigned char var_1_33 = 10; [L47] unsigned char var_1_37 = 64; [L48] signed char var_1_38 = -8; [L49] unsigned short int var_1_40 = 200; [L50] unsigned long int var_1_42 = 2; [L51] unsigned long int var_1_44 = 10; [L52] unsigned short int var_1_45 = 16; [L53] unsigned char last_1_var_1_1 = 128; [L54] unsigned long int last_1_var_1_12 = 8; [L55] double last_1_var_1_17 = 256.8; [L56] unsigned char last_1_var_1_21 = 1; [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L200] last_1_var_1_1 = var_1_1 [L201] last_1_var_1_12 = var_1_12 [L202] last_1_var_1_17 = var_1_17 [L203] last_1_var_1_21 = var_1_21 [L213] RET updateLastVariables() [L214] CALL updateVariables() [L148] var_1_4 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L149] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L150] var_1_5 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L151] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=2, var_1_8=-10, var_1_9=5] [L152] var_1_7 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L153] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_8=-10, var_1_9=5] [L154] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=5] [L154] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=5] [L155] var_1_9 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L156] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L157] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L158] var_1_10 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L160] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L161] var_1_11 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L163] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L164] var_1_13 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L166] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L167] var_1_15 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L170] var_1_18 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L171] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L172] var_1_22 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L173] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L174] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L175] var_1_23 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L176] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L177] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L178] var_1_24 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L179] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L180] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=5, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L181] var_1_27 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_27 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L182] RET assume_abort_if_not(var_1_27 >= -128) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L183] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L183] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L184] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L184] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L185] var_1_28 = __VERIFIER_nondet_char() [L186] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L186] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L187] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L187] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L188] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L188] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_30=54/5, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L189] var_1_30 = __VERIFIER_nondet_float() [L190] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L190] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_31=246/5, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L191] var_1_31 = __VERIFIER_nondet_float() [L192] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L192] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_32=2/5, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L193] var_1_32 = __VERIFIER_nondet_float() [L194] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L194] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L195] var_1_37 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_37 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L196] RET assume_abort_if_not(var_1_37 >= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L197] CALL assume_abort_if_not(var_1_37 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L197] RET assume_abort_if_not(var_1_37 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L214] RET updateVariables() [L215] CALL step() [L60] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L61] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L62] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L63] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=-8, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L70] var_1_38 = var_1_10 [L71] unsigned long int stepLocal_1 = last_1_var_1_12; [L72] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L73] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L74] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L75] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L76] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L82] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=10, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L85] COND TRUE var_1_32 < ((((var_1_30) > (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) ? (var_1_30) : (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) [L86] var_1_33 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=200, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L92] COND TRUE (var_1_37 >= var_1_1) || (! 0) [L93] var_1_40 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=10, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L99] var_1_44 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) + (((((((var_1_7) > (var_1_7)) ? (var_1_7) : (var_1_7))) < 0 ) ? -((((var_1_7) > (var_1_7)) ? (var_1_7) : (var_1_7))) : ((((var_1_7) > (var_1_7)) ? (var_1_7) : (var_1_7)))))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=-10, var_1_9=0] [L100] COND TRUE ! (var_1_17 > var_1_5) [L101] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L105] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L106] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L117] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=2, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L119] COND FALSE !(((((1.000000095E7f) < 0 ) ? -(1.000000095E7f) : (1.000000095E7f))) < ((9.9999999999996E12f - var_1_31) / var_1_22)) [L124] var_1_42 = 100000u VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L126] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=16, var_1_7=0, var_1_8=0, var_1_9=0] [L129] COND TRUE var_1_15 > ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) [L130] var_1_45 = var_1_11 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L135] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L136] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L143] COND FALSE !((var_1_15 % ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28)))) > var_1_15) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L215] RET step() [L216] CALL, EXPR property() [L206-L207] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_27=-1, var_1_28=-1, var_1_33=0, var_1_37=64, var_1_38=0, var_1_40=0, var_1_42=100000, var_1_44=64, var_1_45=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 174 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 10, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1102 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1055 mSDsluCounter, 3180 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2062 mSDsCounter, 689 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1888 IncrementalHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 689 mSolverCounterUnsat, 1118 mSDtfsCounter, 1888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1898 GetRequests, 1794 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=9, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 429 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 3215 NumberOfCodeBlocks, 3215 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3397 ConstructedInterpolants, 0 QuantifiedInterpolants, 12914 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2336 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 32934/33728 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-17 01:23:57,262 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_fillercode_fillercodestructure_filler-pr-ci_file-51.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 a2084c791d87550f3d94f8de030a033d2f092b886e9479453044cdf29085c5fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:23:58,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:23:59,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:23:59,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:23:59,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:23:59,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:23:59,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:23:59,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:23:59,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:23:59,089 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:23:59,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:23:59,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:23:59,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:23:59,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:23:59,090 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:23:59,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:23:59,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:23:59,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2084c791d87550f3d94f8de030a033d2f092b886e9479453044cdf29085c5fe [2025-03-17 01:23:59,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:23:59,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:23:59,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:23:59,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:23:59,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:23:59,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2025-03-17 01:24:00,474 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eb9c04d4/6aea85dca51f4c59b16becfebca9fc8a/FLAG67a0eff0d [2025-03-17 01:24:00,660 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:24:00,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2025-03-17 01:24:00,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eb9c04d4/6aea85dca51f4c59b16becfebca9fc8a/FLAG67a0eff0d [2025-03-17 01:24:00,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eb9c04d4/6aea85dca51f4c59b16becfebca9fc8a [2025-03-17 01:24:00,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:24:00,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:24:00,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:24:00,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:24:00,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:24:00,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4b2928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00, skipping insertion in model container [2025-03-17 01:24:00,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:24:00,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i[919,932] [2025-03-17 01:24:00,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:24:00,889 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:24:00,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i[919,932] [2025-03-17 01:24:00,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:24:00,960 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:24:00,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00 WrapperNode [2025-03-17 01:24:00,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:24:00,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:24:00,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:24:00,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:24:00,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:00,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,012 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-03-17 01:24:01,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:24:01,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:24:01,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:24:01,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:24:01,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,040 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-17 01:24:01,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:24:01,069 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:24:01,069 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:24:01,069 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:24:01,070 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (1/1) ... [2025-03-17 01:24:01,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:24:01,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:24:01,091 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-17 01:24:01,093 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-17 01:24:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:24:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:24:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:24:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:24:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:24:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:24:01,174 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:24:01,175 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:24:27,275 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 01:24:27,275 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:24:27,283 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:24:27,283 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:24:27,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:24:27 BoogieIcfgContainer [2025-03-17 01:24:27,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:24:27,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:24:27,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:24:27,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:24:27,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:24:00" (1/3) ... [2025-03-17 01:24:27,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48065c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:24:27, skipping insertion in model container [2025-03-17 01:24:27,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:24:00" (2/3) ... [2025-03-17 01:24:27,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48065c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:24:27, skipping insertion in model container [2025-03-17 01:24:27,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:24:27" (3/3) ... [2025-03-17 01:24:27,292 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i [2025-03-17 01:24:27,302 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:24:27,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-51.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:24:27,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:24:27,356 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;@5a12efa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:24:27,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:24:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:24:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 01:24:27,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:27,370 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:24:27,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:27,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash 710750771, now seen corresponding path program 1 times [2025-03-17 01:24:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:24:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355733441] [2025-03-17 01:24:27,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:27,383 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-17 01:24:27,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:24:27,386 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-17 01:24:27,387 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-17 01:24:27,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 01:24:28,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 01:24:28,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:28,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:28,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:24:28,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:24:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2025-03-17 01:24:28,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:24:28,847 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:24:28,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355733441] [2025-03-17 01:24:28,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355733441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:28,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:28,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:24:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102891820] [2025-03-17 01:24:28,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:28,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:24:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:24:28,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:24:28,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:24:28,870 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 01:24:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:24:28,896 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2025-03-17 01:24:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:24:28,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2025-03-17 01:24:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:24:28,901 INFO L225 Difference]: With dead ends: 172 [2025-03-17 01:24:28,901 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 01:24:28,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 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-17 01:24:28,906 INFO L435 NwaCegarLoop]: 134 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, 134 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-17 01:24:28,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:24:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 01:24:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 01:24:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 01:24:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2025-03-17 01:24:28,942 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 198 [2025-03-17 01:24:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:24:28,942 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2025-03-17 01:24:28,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 01:24:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2025-03-17 01:24:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 01:24:28,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:24:28,946 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:24:28,980 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-17 01:24:29,148 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-17 01:24:29,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:24:29,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:24:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1867792780, now seen corresponding path program 1 times [2025-03-17 01:24:29,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:24:29,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737918807] [2025-03-17 01:24:29,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:24:29,150 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-17 01:24:29,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:24:29,152 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-17 01:24:29,152 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-17 01:24:29,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 01:24:30,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 01:24:30,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:24:30,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:24:30,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 01:24:30,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:24:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 01:24:36,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:24:36,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:24:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737918807] [2025-03-17 01:24:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737918807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:24:36,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:24:36,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:24:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232562626] [2025-03-17 01:24:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:24:36,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:24:36,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:24:36,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:24:36,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:24:36,636 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 01:24:41,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:24:45,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:24:49,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:24:53,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:24:58,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:25:02,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:25:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:25:02,138 INFO L93 Difference]: Finished difference Result 254 states and 401 transitions. [2025-03-17 01:25:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:25:02,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-03-17 01:25:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:25:02,230 INFO L225 Difference]: With dead ends: 254 [2025-03-17 01:25:02,230 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 01:25:02,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:25:02,236 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 91 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 65 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:25:02,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 381 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 25.4s Time] [2025-03-17 01:25:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 01:25:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 141. [2025-03-17 01:25:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 01:25:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 221 transitions. [2025-03-17 01:25:02,270 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 221 transitions. Word has length 198 [2025-03-17 01:25:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:25:02,273 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 221 transitions. [2025-03-17 01:25:02,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 01:25:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 221 transitions. [2025-03-17 01:25:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-17 01:25:02,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:25:02,275 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:25:02,314 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-17 01:25:02,475 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-17 01:25:02,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:25:02,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:25:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1867233850, now seen corresponding path program 1 times [2025-03-17 01:25:02,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:25:02,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384771276] [2025-03-17 01:25:02,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:25:02,477 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-17 01:25:02,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:25:02,482 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-17 01:25:02,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 01:25:02,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 01:25:03,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 01:25:03,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:25:03,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:25:03,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:25:03,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:25:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 01:25:10,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:25:10,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:25:10,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384771276] [2025-03-17 01:25:10,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384771276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:25:10,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:25:10,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:25:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348775733] [2025-03-17 01:25:10,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:25:10,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:25:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:25:10,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:25:10,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:25:10,022 INFO L87 Difference]: Start difference. First operand 141 states and 221 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 01:25:15,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:25:19,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []