./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.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 c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:03:52,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:03:52,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:03:52,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:03:52,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:03:52,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:03:52,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:03:52,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:03:52,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:03:52,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:03:52,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:03:52,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:03:52,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:03:52,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:03:52,305 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:03:52,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:03:52,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:03:52,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:03:52,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:03:52,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:03:52,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:03:52,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:03:52,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:03:52,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:03:52,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:03:52,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:03:52,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:03:52,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:03:52,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:03:52,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:03:52,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:03:52,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:03:52,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:03:52,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:03:52,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:03:52,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:03:52,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:03:52,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:03:52,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:03:52,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:03:52,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:03:52,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:03:52,319 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 [2024-11-10 07:03:52,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:03:52,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:03:52,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:03:52,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:03:52,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:03:52,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-10 07:03:54,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:03:54,393 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:03:54,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-10 07:03:54,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add12d761/32a5f61c44e44e69ad69db8341261332/FLAGe7cb67db0 [2024-11-10 07:03:54,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add12d761/32a5f61c44e44e69ad69db8341261332 [2024-11-10 07:03:54,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:03:54,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:03:54,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:03:54,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:03:54,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:03:54,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:54,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30362e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54, skipping insertion in model container [2024-11-10 07:03:54,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:54,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:03:54,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-11-10 07:03:54,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:03:54,754 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:03:54,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-11-10 07:03:54,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:03:54,818 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:03:54,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54 WrapperNode [2024-11-10 07:03:54,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:03:54,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:03:54,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:03:54,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:03:54,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:54,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:54,925 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-10 07:03:54,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:03:54,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:03:54,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:03:54,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:03:54,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:54,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:54,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:54,982 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]. [2024-11-10 07:03:54,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:54,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:54,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:55,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:55,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:55,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:55,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:03:55,025 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:03:55,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:03:55,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:03:55,028 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (1/1) ... [2024-11-10 07:03:55,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:03:55,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:55,061 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) [2024-11-10 07:03:55,065 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 [2024-11-10 07:03:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:03:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:03:55,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:03:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:03:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:03:55,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:03:55,183 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:03:55,185 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:03:55,661 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-10 07:03:55,661 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:03:55,680 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:03:55,681 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:03:55,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:55 BoogieIcfgContainer [2024-11-10 07:03:55,682 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:03:55,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:03:55,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:03:55,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:03:55,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:03:54" (1/3) ... [2024-11-10 07:03:55,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ac7c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:03:55, skipping insertion in model container [2024-11-10 07:03:55,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:54" (2/3) ... [2024-11-10 07:03:55,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ac7c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:03:55, skipping insertion in model container [2024-11-10 07:03:55,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:55" (3/3) ... [2024-11-10 07:03:55,694 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-10 07:03:55,711 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:03:55,712 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:03:55,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:03:55,786 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;@25429891, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:03:55,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:03:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 07:03:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 07:03:55,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:55,813 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:55,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:55,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:55,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1230407045, now seen corresponding path program 1 times [2024-11-10 07:03:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234008751] [2024-11-10 07:03:55,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:55,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:03:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:03:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:03:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:03:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:03:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:03:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:03:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:03:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:03:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:03:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:03:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:03:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:03:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:03:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:03:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:03:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:03:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:03:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:03:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:03:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:03:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:03:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 07:03:56,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:56,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234008751] [2024-11-10 07:03:56,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234008751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:03:56,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:03:56,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:03:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178077659] [2024-11-10 07:03:56,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:03:56,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:03:56,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:56,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:03:56,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:03:56,407 INFO L87 Difference]: Start difference. First operand has 86 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 07:03:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:56,446 INFO L93 Difference]: Finished difference Result 168 states and 283 transitions. [2024-11-10 07:03:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:03:56,451 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-10 07:03:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:56,458 INFO L225 Difference]: With dead ends: 168 [2024-11-10 07:03:56,458 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 07:03:56,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:03:56,465 INFO L432 NwaCegarLoop]: 127 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, 127 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 [2024-11-10 07:03:56,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:03:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 07:03:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-10 07:03:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 07:03:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-11-10 07:03:56,591 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 167 [2024-11-10 07:03:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:56,592 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-11-10 07:03:56,594 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 07:03:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-11-10 07:03:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 07:03:56,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:56,600 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:56,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:03:56,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:56,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1606806570, now seen corresponding path program 1 times [2024-11-10 07:03:56,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961524516] [2024-11-10 07:03:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:03:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:03:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:03:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:03:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:03:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:03:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:03:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:03:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:03:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:03:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:03:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:03:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:03:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:03:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:03:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:03:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:03:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:03:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:03:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:03:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:03:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:03:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 07:03:57,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:57,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961524516] [2024-11-10 07:03:57,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961524516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:03:57,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:03:57,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:03:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648901608] [2024-11-10 07:03:57,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:03:57,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:03:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:03:57,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:03:57,367 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 07:03:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:57,637 INFO L93 Difference]: Finished difference Result 239 states and 365 transitions. [2024-11-10 07:03:57,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:03:57,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-10 07:03:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:57,644 INFO L225 Difference]: With dead ends: 239 [2024-11-10 07:03:57,644 INFO L226 Difference]: Without dead ends: 161 [2024-11-10 07:03:57,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:03:57,646 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 93 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:57,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 463 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:03:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-10 07:03:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 128. [2024-11-10 07:03:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 07:03:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 194 transitions. [2024-11-10 07:03:57,679 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 194 transitions. Word has length 167 [2024-11-10 07:03:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:57,680 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 194 transitions. [2024-11-10 07:03:57,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 07:03:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 194 transitions. [2024-11-10 07:03:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 07:03:57,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:57,683 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:03:57,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:57,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash -993115732, now seen corresponding path program 1 times [2024-11-10 07:03:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324234106] [2024-11-10 07:03:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:03:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:03:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 07:03:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 07:03:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 07:03:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:03:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:03:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:03:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:03:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:03:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:03:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:03:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:03:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:03:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:03:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:03:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:03:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:03:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:03:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:03:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:03:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:03:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-10 07:03:58,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:58,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324234106] [2024-11-10 07:03:58,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324234106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:03:58,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584513685] [2024-11-10 07:03:58,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:58,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:58,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:58,459 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) [2024-11-10 07:03:58,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:03:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:58,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:03:58,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2024-11-10 07:03:58,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:03:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-10 07:03:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584513685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:03:59,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:03:59,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:03:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424858785] [2024-11-10 07:03:59,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:03:59,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:03:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:59,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:03:59,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:03:59,047 INFO L87 Difference]: Start difference. First operand 128 states and 194 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 07:03:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:59,285 INFO L93 Difference]: Finished difference Result 222 states and 328 transitions. [2024-11-10 07:03:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:03:59,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 168 [2024-11-10 07:03:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:59,291 INFO L225 Difference]: With dead ends: 222 [2024-11-10 07:03:59,291 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 07:03:59,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:03:59,296 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 76 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:59,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 224 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:03:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 07:03:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2024-11-10 07:03:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 07:03:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-11-10 07:03:59,333 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 168 [2024-11-10 07:03:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:59,337 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-11-10 07:03:59,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 07:03:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-11-10 07:03:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 07:03:59,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:59,344 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:59,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:03:59,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:59,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:59,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1846473577, now seen corresponding path program 1 times [2024-11-10 07:03:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:59,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345090540] [2024-11-10 07:03:59,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:59,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:03:59,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143002447] [2024-11-10 07:03:59,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:59,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:59,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:59,745 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) [2024-11-10 07:03:59,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 07:03:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:03:59,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:04:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:04:00,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:04:00,208 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:04:00,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:04:00,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 07:04:00,412 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,SelfDestructingSolverStorable3 [2024-11-10 07:04:00,415 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 07:04:00,538 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:04:00,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:04:00 BoogieIcfgContainer [2024-11-10 07:04:00,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:04:00,544 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:04:00,544 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:04:00,544 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:04:00,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:55" (3/4) ... [2024-11-10 07:04:00,547 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:04:00,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:04:00,549 INFO L158 Benchmark]: Toolchain (without parser) took 6121.08ms. Allocated memory was 197.1MB in the beginning and 268.4MB in the end (delta: 71.3MB). Free memory was 123.2MB in the beginning and 94.0MB in the end (delta: 29.2MB). Peak memory consumption was 103.4MB. Max. memory is 16.1GB. [2024-11-10 07:04:00,550 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 197.1MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:04:00,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.09ms. Allocated memory is still 197.1MB. Free memory was 123.0MB in the beginning and 104.8MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 07:04:00,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.88ms. Allocated memory is still 197.1MB. Free memory was 104.8MB in the beginning and 163.4MB in the end (delta: -58.6MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-10 07:04:00,551 INFO L158 Benchmark]: Boogie Preprocessor took 97.01ms. Allocated memory is still 197.1MB. Free memory was 163.4MB in the beginning and 151.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 07:04:00,551 INFO L158 Benchmark]: IcfgBuilder took 656.95ms. Allocated memory is still 197.1MB. Free memory was 151.9MB in the beginning and 119.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 07:04:00,553 INFO L158 Benchmark]: TraceAbstraction took 4858.76ms. Allocated memory was 197.1MB in the beginning and 268.4MB in the end (delta: 71.3MB). Free memory was 119.4MB in the beginning and 94.0MB in the end (delta: 25.4MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. [2024-11-10 07:04:00,553 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 268.4MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:04:00,554 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.18ms. Allocated memory is still 197.1MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.09ms. Allocated memory is still 197.1MB. Free memory was 123.0MB in the beginning and 104.8MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.88ms. Allocated memory is still 197.1MB. Free memory was 104.8MB in the beginning and 163.4MB in the end (delta: -58.6MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.01ms. Allocated memory is still 197.1MB. Free memory was 163.4MB in the beginning and 151.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 656.95ms. Allocated memory is still 197.1MB. Free memory was 151.9MB in the beginning and 119.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4858.76ms. Allocated memory was 197.1MB in the beginning and 268.4MB in the end (delta: 71.3MB). Free memory was 119.4MB in the beginning and 94.0MB in the end (delta: 25.4MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 268.4MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryArithmeticFLOAToperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] unsigned char var_1_3 = 0; [L24] float var_1_8 = 128.5; [L25] float var_1_9 = 127.75; [L26] float var_1_10 = 31.8; [L27] float var_1_11 = 32.5; [L28] unsigned char var_1_12 = 8; [L29] unsigned char var_1_13 = 100; [L30] unsigned char var_1_14 = 25; [L31] unsigned char var_1_15 = 32; [L32] unsigned char var_1_16 = 16; [L33] double var_1_17 = 64.8; [L34] unsigned char var_1_18 = 1; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed char var_1_21 = -100; [L38] signed long int var_1_22 = -1; [L39] float var_1_23 = 5.6; [L40] float var_1_24 = 50.88; [L41] signed short int var_1_25 = -5; [L42] unsigned char var_1_26 = 1; [L43] unsigned char var_1_27 = 128; [L44] unsigned char var_1_28 = 5; [L45] signed short int var_1_29 = -64; [L46] unsigned long int var_1_32 = 16; [L47] unsigned char last_1_var_1_12 = 8; [L48] unsigned char last_1_var_1_18 = 1; [L49] signed short int last_1_var_1_25 = -5; [L50] unsigned char last_1_var_1_26 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L191] isInitial = 1 [L192] FCALL initially() [L193] int k_loop; [L194] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L194] COND TRUE k_loop < 1 [L195] CALL updateLastVariables() [L181] last_1_var_1_12 = var_1_12 [L182] last_1_var_1_18 = var_1_18 [L183] last_1_var_1_25 = var_1_25 [L184] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L141] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L142] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L142] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L143] var_1_9 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L144] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L145] var_1_10 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L146] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L147] var_1_11 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L148] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L150] RET assume_abort_if_not(var_1_13 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L151] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L151] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L152] var_1_14 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L153] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L154] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L154] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L155] var_1_15 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_15 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L156] RET assume_abort_if_not(var_1_15 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L157] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L157] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L158] var_1_16 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L159] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L160] CALL assume_abort_if_not(var_1_16 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L160] RET assume_abort_if_not(var_1_16 <= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L161] var_1_19 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L162] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L163] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L163] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L164] var_1_20 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L165] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L166] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L166] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L167] var_1_22 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_22 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L168] RET assume_abort_if_not(var_1_22 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L169] CALL assume_abort_if_not(var_1_22 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L169] RET assume_abort_if_not(var_1_22 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L170] CALL assume_abort_if_not(var_1_22 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L170] RET assume_abort_if_not(var_1_22 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L171] var_1_24 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L172] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L173] var_1_27 = __VERIFIER_nondet_uchar() [L174] 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_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L174] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L175] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L175] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L176] var_1_28 = __VERIFIER_nondet_uchar() [L177] 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_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L177] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L178] 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_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L178] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L196] RET updateVariables() [L197] CALL step() [L54] unsigned char stepLocal_1 = last_1_var_1_18; [L55] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_0=8, stepLocal_1=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L56] COND TRUE last_1_var_1_18 || stepLocal_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_0=8, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L57] COND TRUE stepLocal_0 >= last_1_var_1_26 [L58] var_1_1 = (last_1_var_1_12 + last_1_var_1_12) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L65] unsigned long int stepLocal_8 = 10u / var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_8=0, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L66] COND TRUE ! var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_8=0, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L67] COND TRUE stepLocal_8 < (var_1_22 + var_1_1) [L68] var_1_26 = ((((var_1_13) < ((var_1_27 - var_1_28))) ? (var_1_13) : ((var_1_27 - var_1_28)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L73] signed long int stepLocal_4 = ((((var_1_16) < (var_1_13)) ? (var_1_16) : (var_1_13))) / var_1_22; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_4=-1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L74] COND TRUE ((25 + var_1_26) / var_1_15) > stepLocal_4 [L75] var_1_21 = ((((var_1_16) < (var_1_14)) ? (var_1_16) : (var_1_14))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L79] signed short int stepLocal_3 = var_1_1; [L80] signed char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_2=2, stepLocal_3=16, var_1_12=8, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L81] COND TRUE var_1_1 >= stepLocal_2 [L82] var_1_12 = ((var_1_13 - var_1_14) + (100 - (var_1_15 - var_1_16))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L90] var_1_8 = ((var_1_9 - var_1_10) + var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1] [L91] COND TRUE \read(var_1_3) [L92] var_1_18 = (var_1_19 || ((var_1_10 > var_1_8) && var_1_20)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1] [L96] unsigned char stepLocal_10 = var_1_26; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=0, stepLocal_3=16, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=16, var_1_3=1] [L97] COND FALSE !(var_1_8 <= (var_1_24 * ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) [L104] var_1_32 = var_1_27 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=0, stepLocal_3=16, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=127, var_1_3=1] [L106] COND TRUE (((((var_1_13) > (0)) ? (var_1_13) : (0))) - var_1_32) >= var_1_32 [L107] var_1_17 = (var_1_10 + var_1_9) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=0, stepLocal_3=16, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_23=28/5, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=127, var_1_3=1] [L113] COND TRUE var_1_32 <= (- var_1_21) [L114] var_1_23 = ((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) - var_1_24) + var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=0, stepLocal_3=16, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=127, var_1_3=1] [L118] signed long int stepLocal_7 = -32; [L119] unsigned long int stepLocal_6 = var_1_32; [L120] unsigned char stepLocal_5 = 10 > 8; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=0, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, stepLocal_7=-32, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_25=-5, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=127, var_1_3=1] [L121] COND FALSE !(stepLocal_7 > (~ last_1_var_1_25)) [L128] var_1_25 = var_1_14 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=0, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_25=2, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=127, var_1_3=1] [L130] unsigned char stepLocal_9 = var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=0, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, stepLocal_9=0, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_25=2, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=-64, var_1_32=127, var_1_3=1] [L131] COND FALSE !(stepLocal_9 && var_1_18) [L136] var_1_29 = 1000 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=0, stepLocal_3=16, stepLocal_5=1, stepLocal_6=127, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_25=2, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=1000, var_1_32=127, var_1_3=1] [L197] RET step() [L198] CALL, EXPR property() [L187-L188] return (((((((((((last_1_var_1_18 || last_1_var_1_18) ? ((last_1_var_1_12 >= last_1_var_1_26) ? (var_1_1 == ((signed short int) (last_1_var_1_12 + last_1_var_1_12))) : (var_1_1 == ((signed short int) last_1_var_1_12))) : (var_1_1 == ((signed short int) last_1_var_1_12))) && (var_1_8 == ((float) ((var_1_9 - var_1_10) + var_1_11)))) && ((var_1_1 >= var_1_21) ? (var_1_12 == ((unsigned char) ((var_1_13 - var_1_14) + (100 - (var_1_15 - var_1_16))))) : ((var_1_1 <= 100) ? (var_1_12 == ((unsigned char) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))))) : (var_1_12 == ((unsigned char) var_1_13))))) && (((((((var_1_13) > (0)) ? (var_1_13) : (0))) - var_1_32) >= var_1_32) ? (var_1_17 == ((double) (var_1_10 + var_1_9))) : (var_1_18 ? (var_1_17 == ((double) var_1_9)) : 1))) && (var_1_3 ? (var_1_18 == ((unsigned char) (var_1_19 || ((var_1_10 > var_1_8) && var_1_20)))) : (var_1_18 == ((unsigned char) ((! (! var_1_19)) || var_1_20))))) && ((((25 + var_1_26) / var_1_15) > (((((var_1_16) < (var_1_13)) ? (var_1_16) : (var_1_13))) / var_1_22)) ? (var_1_21 == ((signed char) ((((var_1_16) < (var_1_14)) ? (var_1_16) : (var_1_14))))) : (var_1_21 == ((signed char) var_1_14)))) && ((var_1_32 <= (- var_1_21)) ? (var_1_23 == ((float) ((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) - var_1_24) + var_1_11))) : (var_1_23 == ((float) ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))))))) && ((-32 > (~ last_1_var_1_25)) ? (((var_1_10 <= (- var_1_9)) || (10 > 8)) ? ((last_1_var_1_25 > var_1_32) ? (var_1_25 == ((signed short int) var_1_32)) : 1) : 1) : (var_1_25 == ((signed short int) var_1_14)))) && ((! var_1_20) ? (((10u / var_1_13) < (var_1_22 + var_1_1)) ? (var_1_26 == ((unsigned char) ((((var_1_13) < ((var_1_27 - var_1_28))) ? (var_1_13) : ((var_1_27 - var_1_28)))))) : (var_1_26 == ((unsigned char) (var_1_16 + var_1_15)))) : 1)) && ((var_1_18 && var_1_18) ? (((var_1_10 - (var_1_9 + var_1_24)) == var_1_23) ? (var_1_29 == ((signed short int) ((((var_1_14) < (((((1) < (var_1_21)) ? (1) : (var_1_21))))) ? (var_1_14) : (((((1) < (var_1_21)) ? (1) : (var_1_21)))))))) : 1) : (var_1_29 == ((signed short int) 1000)))) && ((var_1_8 <= (var_1_24 * ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) ? ((var_1_26 > (- (- var_1_26))) ? (var_1_32 == ((unsigned long int) var_1_26)) : (var_1_32 == ((unsigned long int) var_1_13))) : (var_1_32 == ((unsigned long int) var_1_27))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_25=2, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=1000, var_1_32=127, var_1_3=1] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_25=2, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=1000, var_1_32=127, var_1_3=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=135, var_1_13=319, var_1_14=2, var_1_15=-455, var_1_16=31, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=2, var_1_22=-30, var_1_25=2, var_1_26=0, var_1_27=127, var_1_28=127, var_1_29=1000, var_1_32=127, var_1_3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 814 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 477 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 337 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 526 GetRequests, 511 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 41 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 1307 SizeOfPredicates, 1 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 5928/6000 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 07:04:00,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.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 c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:04:02,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:04:03,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:04:03,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:04:03,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:04:03,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:04:03,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:04:03,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:04:03,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:04:03,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:04:03,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:04:03,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:04:03,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:04:03,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:04:03,120 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:04:03,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:04:03,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:04:03,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:04:03,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:04:03,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:04:03,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:04:03,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:04:03,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:04:03,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:04:03,135 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:04:03,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:04:03,135 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:04:03,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:04:03,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:04:03,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:04:03,136 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:04:03,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:04:03,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:04:03,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:04:03,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:04:03,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:04:03,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:04:03,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:04:03,137 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:04:03,138 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:04:03,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:04:03,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:04:03,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:04:03,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:04:03,139 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 [2024-11-10 07:04:03,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:04:03,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:04:03,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:04:03,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:04:03,510 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:04:03,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-10 07:04:05,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:04:05,463 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:04:05,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-10 07:04:05,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c67c4fe/903b063ddcf64e0fa346fb9d0b4d69ce/FLAG18398a1f9 [2024-11-10 07:04:05,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c67c4fe/903b063ddcf64e0fa346fb9d0b4d69ce [2024-11-10 07:04:05,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:04:05,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:04:05,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:04:05,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:04:05,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:04:05,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:04:05" (1/1) ... [2024-11-10 07:04:05,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e3d5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:05, skipping insertion in model container [2024-11-10 07:04:05,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:04:05" (1/1) ... [2024-11-10 07:04:05,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:04:05,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-11-10 07:04:05,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:04:05,894 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:04:05,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-11-10 07:04:05,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:04:06,008 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:04:06,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06 WrapperNode [2024-11-10 07:04:06,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:04:06,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:04:06,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:04:06,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:04:06,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,081 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-10 07:04:06,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:04:06,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:04:06,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:04:06,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:04:06,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,137 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]. [2024-11-10 07:04:06,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:04:06,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:04:06,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:04:06,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:04:06,179 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (1/1) ... [2024-11-10 07:04:06,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:04:06,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:04:06,215 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) [2024-11-10 07:04:06,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:04:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:04:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:04:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:04:06,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:04:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:04:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:04:06,370 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:04:06,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:04:12,833 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-10 07:04:12,833 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:04:12,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:04:12,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:04:12,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:04:12 BoogieIcfgContainer [2024-11-10 07:04:12,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:04:12,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:04:12,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:04:12,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:04:12,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:04:05" (1/3) ... [2024-11-10 07:04:12,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cbf9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:04:12, skipping insertion in model container [2024-11-10 07:04:12,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:06" (2/3) ... [2024-11-10 07:04:12,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cbf9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:04:12, skipping insertion in model container [2024-11-10 07:04:12,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:04:12" (3/3) ... [2024-11-10 07:04:12,858 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-11-10 07:04:12,874 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:04:12,874 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:04:12,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:04:12,947 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;@7a89533c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:04:12,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:04:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 07:04:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 07:04:12,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:04:12,971 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:04:12,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:04:12,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:04:12,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1230407045, now seen corresponding path program 1 times [2024-11-10 07:04:13,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:04:13,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354653205] [2024-11-10 07:04:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:04:13,015 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 [2024-11-10 07:04:13,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:04:13,019 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) [2024-11-10 07:04:13,020 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 [2024-11-10 07:04:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:04:13,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:04:13,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:04:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-10 07:04:13,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:04:13,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:04:13,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354653205] [2024-11-10 07:04:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354653205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:04:13,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:04:13,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:04:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776268108] [2024-11-10 07:04:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:04:13,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:04:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:04:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:04:13,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:04:13,765 INFO L87 Difference]: Start difference. First operand has 86 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 07:04:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:04:13,793 INFO L93 Difference]: Finished difference Result 168 states and 283 transitions. [2024-11-10 07:04:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:04:13,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-10 07:04:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:04:13,804 INFO L225 Difference]: With dead ends: 168 [2024-11-10 07:04:13,804 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 07:04:13,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:04:13,810 INFO L432 NwaCegarLoop]: 127 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, 127 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 [2024-11-10 07:04:13,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:04:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 07:04:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-10 07:04:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 07:04:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-11-10 07:04:13,856 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 167 [2024-11-10 07:04:13,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:04:13,856 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-11-10 07:04:13,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 07:04:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-11-10 07:04:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 07:04:13,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:04:13,860 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:04:13,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:04:14,061 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 [2024-11-10 07:04:14,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:04:14,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:04:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1606806570, now seen corresponding path program 1 times [2024-11-10 07:04:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:04:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232038224] [2024-11-10 07:04:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:04:14,064 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 [2024-11-10 07:04:14,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:04:14,066 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) [2024-11-10 07:04:14,067 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 [2024-11-10 07:04:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:04:14,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:04:14,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:04:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 07:04:16,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:04:16,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:04:16,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232038224] [2024-11-10 07:04:16,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232038224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:04:16,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:04:16,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:04:16,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908291999] [2024-11-10 07:04:16,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:04:16,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:04:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:04:16,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:04:16,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:04:16,636 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 07:04:21,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:23,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:27,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:04:27,445 INFO L93 Difference]: Finished difference Result 239 states and 365 transitions. [2024-11-10 07:04:27,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:04:27,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-10 07:04:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:04:27,492 INFO L225 Difference]: With dead ends: 239 [2024-11-10 07:04:27,493 INFO L226 Difference]: Without dead ends: 161 [2024-11-10 07:04:27,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:04:27,495 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 90 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 51 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-10 07:04:27,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 463 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2024-11-10 07:04:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-10 07:04:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 128. [2024-11-10 07:04:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 07:04:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 194 transitions. [2024-11-10 07:04:27,536 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 194 transitions. Word has length 167 [2024-11-10 07:04:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:04:27,541 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 194 transitions. [2024-11-10 07:04:27,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 07:04:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 194 transitions. [2024-11-10 07:04:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 07:04:27,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:04:27,547 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:04:27,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 07:04:27,748 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 [2024-11-10 07:04:27,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:04:27,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:04:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash -993115732, now seen corresponding path program 1 times [2024-11-10 07:04:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:04:27,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321566269] [2024-11-10 07:04:27,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:04:27,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:04:27,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:04:27,755 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) [2024-11-10 07:04:27,758 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 [2024-11-10 07:04:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:04:28,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:04:28,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:04:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2024-11-10 07:04:29,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:04:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-10 07:04:30,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:04:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321566269] [2024-11-10 07:04:30,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321566269] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:04:30,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:04:30,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 07:04:30,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656920987] [2024-11-10 07:04:30,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:04:30,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:04:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:04:30,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:04:30,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:04:30,341 INFO L87 Difference]: Start difference. First operand 128 states and 194 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 07:04:35,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:39,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:43,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:04:43,730 INFO L93 Difference]: Finished difference Result 222 states and 328 transitions. [2024-11-10 07:04:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:04:43,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 168 [2024-11-10 07:04:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:04:43,780 INFO L225 Difference]: With dead ends: 222 [2024-11-10 07:04:43,780 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 07:04:43,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:04:43,782 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 76 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:04:43,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 221 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2024-11-10 07:04:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 07:04:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2024-11-10 07:04:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 07:04:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-11-10 07:04:43,809 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 168 [2024-11-10 07:04:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:04:43,810 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-11-10 07:04:43,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 07:04:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-11-10 07:04:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 07:04:43,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:04:43,815 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:04:43,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 07:04:44,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:04:44,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:04:44,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:04:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1846473577, now seen corresponding path program 1 times [2024-11-10 07:04:44,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:04:44,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697190672] [2024-11-10 07:04:44,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:04:44,017 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 [2024-11-10 07:04:44,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:04:44,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:04:44,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 07:04:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:04:45,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-10 07:04:45,713 INFO L278 TraceCheckSpWp]: Computing forward predicates...