./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.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_fillercode_fillercodestructure_filler-pr-ci_file-79.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 b80f3f9a0690b8b137c3e78a4bda741a5ebccde814b37d3c17d2da8a165237b2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:31:40,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:31:40,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:31:40,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:31:40,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:31:40,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:31:40,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:31:40,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:31:40,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:31:40,343 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:31:40,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:31:40,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:31:40,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:31:40,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:31:40,347 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:31:40,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:31:40,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:31:40,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:31:40,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:31:40,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:31:40,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:31:40,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:31:40,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:31:40,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:31:40,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:31:40,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:31:40,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:31:40,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:31:40,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:31:40,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:31:40,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:31:40,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:31:40,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:31:40,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:31:40,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:31:40,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:31:40,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:31:40,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:31:40,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:31:40,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:31:40,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:31:40,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:31:40,361 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 -> b80f3f9a0690b8b137c3e78a4bda741a5ebccde814b37d3c17d2da8a165237b2 [2024-11-10 05:31:40,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:31:40,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:31:40,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:31:40,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:31:40,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:31:40,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-11-10 05:31:42,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:31:42,338 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:31:42,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-11-10 05:31:42,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc734aea/4350db7057a44825acb7cfb5d557b9b2/FLAGa7d2face4 [2024-11-10 05:31:42,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc734aea/4350db7057a44825acb7cfb5d557b9b2 [2024-11-10 05:31:42,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:31:42,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:31:42,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:31:42,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:31:42,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:31:42,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:31:42" (1/1) ... [2024-11-10 05:31:42,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41679fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:42, skipping insertion in model container [2024-11-10 05:31:42,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:31:42" (1/1) ... [2024-11-10 05:31:42,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:31:42,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i[919,932] [2024-11-10 05:31:43,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:31:43,018 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:31:43,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i[919,932] [2024-11-10 05:31:43,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:31:43,088 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:31:43,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43 WrapperNode [2024-11-10 05:31:43,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:31:43,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:31:43,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:31:43,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:31:43,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,165 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-11-10 05:31:43,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:31:43,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:31:43,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:31:43,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:31:43,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,227 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 05:31:43,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,268 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:31:43,298 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:31:43,298 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:31:43,298 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:31:43,299 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (1/1) ... [2024-11-10 05:31:43,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:31:43,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:31:43,359 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 05:31:43,374 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 05:31:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:31:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:31:43,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:31:43,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:31:43,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:31:43,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:31:43,522 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:31:43,524 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:31:43,993 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 05:31:43,993 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:31:44,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:31:44,018 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:31:44,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:31:44 BoogieIcfgContainer [2024-11-10 05:31:44,018 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:31:44,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:31:44,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:31:44,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:31:44,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:31:42" (1/3) ... [2024-11-10 05:31:44,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61529ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:31:44, skipping insertion in model container [2024-11-10 05:31:44,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:43" (2/3) ... [2024-11-10 05:31:44,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61529ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:31:44, skipping insertion in model container [2024-11-10 05:31:44,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:31:44" (3/3) ... [2024-11-10 05:31:44,028 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-11-10 05:31:44,042 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:31:44,042 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:31:44,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:31:44,114 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;@2ce304c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:31:44,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:31:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 64 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 05:31:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 05:31:44,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:31:44,132 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:31:44,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:31:44,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:31:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1074710554, now seen corresponding path program 1 times [2024-11-10 05:31:44,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:31:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780464967] [2024-11-10 05:31:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:31:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:31:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:31:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:31:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:31:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:31:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:31:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:31:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:31:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:31:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:31:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:31:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:31:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:31:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 05:31:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:31:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 05:31:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:31:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 05:31:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:31:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 05:31:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:31:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 05:31:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 05:31:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 05:31:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:31:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 05:31:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 05:31:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 05:31:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:31:44,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:31:44,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780464967] [2024-11-10 05:31:44,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780464967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:31:44,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:31:44,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:31:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799486779] [2024-11-10 05:31:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:31:44,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:31:44,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:31:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:31:44,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:31:44,627 INFO L87 Difference]: Start difference. First operand has 94 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 64 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 05:31:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:31:44,662 INFO L93 Difference]: Finished difference Result 180 states and 309 transitions. [2024-11-10 05:31:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:31:44,664 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-10 05:31:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:31:44,672 INFO L225 Difference]: With dead ends: 180 [2024-11-10 05:31:44,673 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 05:31:44,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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 05:31:44,680 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:31:44,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:31:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 05:31:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 05:31:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 05:31:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2024-11-10 05:31:44,743 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 186 [2024-11-10 05:31:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:31:44,743 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2024-11-10 05:31:44,744 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 05:31:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2024-11-10 05:31:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 05:31:44,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:31:44,750 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:31:44,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:31:44,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:31:44,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:31:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash 75781474, now seen corresponding path program 1 times [2024-11-10 05:31:44,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:31:44,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544458221] [2024-11-10 05:31:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:44,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:31:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:31:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:31:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:31:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:31:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:31:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:31:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:31:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:31:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:31:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:31:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:31:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:31:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:31:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 05:31:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:31:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 05:31:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:31:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 05:31:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:31:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 05:31:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:31:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 05:31:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 05:31:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 05:31:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:31:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 05:31:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 05:31:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 05:31:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:31:45,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:31:45,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544458221] [2024-11-10 05:31:45,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544458221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:31:45,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:31:45,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:31:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207114959] [2024-11-10 05:31:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:31:45,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:31:45,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:31:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:31:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:31:45,365 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:31:45,450 INFO L93 Difference]: Finished difference Result 261 states and 402 transitions. [2024-11-10 05:31:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:31:45,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-10 05:31:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:31:45,457 INFO L225 Difference]: With dead ends: 261 [2024-11-10 05:31:45,458 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 05:31:45,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:31:45,463 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 68 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:31:45,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 267 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:31:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 05:31:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2024-11-10 05:31:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 113 states have internal predecessors, (153), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 05:31:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2024-11-10 05:31:45,507 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 186 [2024-11-10 05:31:45,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:31:45,507 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2024-11-10 05:31:45,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2024-11-10 05:31:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 05:31:45,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:31:45,511 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:31:45,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:31:45,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:31:45,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:31:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash 745680261, now seen corresponding path program 1 times [2024-11-10 05:31:45,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:31:45,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112622544] [2024-11-10 05:31:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:31:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:31:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:31:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:31:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:31:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:31:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:31:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:31:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:31:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:31:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:31:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:31:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:31:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:31:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 05:31:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:31:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 05:31:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:31:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 05:31:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:31:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 05:31:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:31:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 05:31:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 05:31:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 05:31:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:31:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 05:31:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 05:31:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 05:31:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:31:46,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:31:46,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112622544] [2024-11-10 05:31:46,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112622544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:31:46,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:31:46,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:31:46,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856800435] [2024-11-10 05:31:46,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:31:46,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:31:46,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:31:46,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:31:46,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:31:46,072 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:31:46,319 INFO L93 Difference]: Finished difference Result 375 states and 576 transitions. [2024-11-10 05:31:46,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:31:46,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-10 05:31:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:31:46,325 INFO L225 Difference]: With dead ends: 375 [2024-11-10 05:31:46,328 INFO L226 Difference]: Without dead ends: 206 [2024-11-10 05:31:46,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:31:46,331 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 160 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:31:46,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 474 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:31:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-10 05:31:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 172. [2024-11-10 05:31:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 113 states have (on average 1.345132743362832) internal successors, (152), 113 states have internal predecessors, (152), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 05:31:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2024-11-10 05:31:46,355 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 187 [2024-11-10 05:31:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:31:46,356 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2024-11-10 05:31:46,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2024-11-10 05:31:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-10 05:31:46,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:31:46,359 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:31:46,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:31:46,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:31:46,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:31:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash 641026816, now seen corresponding path program 1 times [2024-11-10 05:31:46,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:31:46,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083570600] [2024-11-10 05:31:46,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:46,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:31:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:31:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:31:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:31:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:31:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:31:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:31:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:31:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:31:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:31:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:31:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:31:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:31:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:31:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 05:31:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:31:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 05:31:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:31:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 05:31:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:31:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 05:31:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:31:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 05:31:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 05:31:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 05:31:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:31:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 05:31:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 05:31:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 05:31:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:31:46,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:31:46,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083570600] [2024-11-10 05:31:46,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083570600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:31:46,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:31:46,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:31:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413419309] [2024-11-10 05:31:46,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:31:46,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:31:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:31:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:31:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:31:46,622 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:31:46,664 INFO L93 Difference]: Finished difference Result 366 states and 568 transitions. [2024-11-10 05:31:46,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:31:46,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-10 05:31:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:31:46,671 INFO L225 Difference]: With dead ends: 366 [2024-11-10 05:31:46,671 INFO L226 Difference]: Without dead ends: 197 [2024-11-10 05:31:46,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:31:46,673 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 43 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:31:46,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 299 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:31:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-10 05:31:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 172. [2024-11-10 05:31:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 05:31:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2024-11-10 05:31:46,712 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 188 [2024-11-10 05:31:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:31:46,713 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2024-11-10 05:31:46,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2024-11-10 05:31:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-10 05:31:46,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:31:46,717 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:31:46,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:31:46,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:31:46,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:31:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1885791297, now seen corresponding path program 1 times [2024-11-10 05:31:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:31:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81540290] [2024-11-10 05:31:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:31:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:31:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:31:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:31:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:31:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:31:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:31:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:31:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:31:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:31:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:31:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:31:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:31:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:31:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 05:31:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:31:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 05:31:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:31:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 05:31:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:31:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 05:31:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:31:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 05:31:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 05:31:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 05:31:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:31:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 05:31:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 05:31:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 05:31:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:31:47,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:31:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81540290] [2024-11-10 05:31:47,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81540290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:31:47,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:31:47,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:31:47,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142413574] [2024-11-10 05:31:47,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:31:47,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:31:47,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:31:47,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:31:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:31:47,039 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:31:47,160 INFO L93 Difference]: Finished difference Result 402 states and 607 transitions. [2024-11-10 05:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:31:47,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-10 05:31:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:31:47,165 INFO L225 Difference]: With dead ends: 402 [2024-11-10 05:31:47,165 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 05:31:47,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:31:47,168 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 39 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:31:47,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 397 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:31:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 05:31:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 228. [2024-11-10 05:31:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 159 states have (on average 1.3459119496855345) internal successors, (214), 161 states have internal predecessors, (214), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 05:31:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 342 transitions. [2024-11-10 05:31:47,202 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 342 transitions. Word has length 188 [2024-11-10 05:31:47,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:31:47,203 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 342 transitions. [2024-11-10 05:31:47,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 342 transitions. [2024-11-10 05:31:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 05:31:47,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:31:47,206 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:31:47,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:31:47,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:31:47,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:31:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash 33711819, now seen corresponding path program 1 times [2024-11-10 05:31:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:31:47,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247328969] [2024-11-10 05:31:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:47,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:31:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:31:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:31:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:31:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:31:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:31:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:31:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:31:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:31:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:31:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:31:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:31:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:31:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:31:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 05:31:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:31:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 05:31:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:31:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 05:31:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:31:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 05:31:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:31:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 05:31:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 05:31:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 05:31:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:31:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 05:31:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 05:31:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 05:31:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:31:47,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:31:47,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247328969] [2024-11-10 05:31:47,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247328969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:31:47,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:31:47,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:31:47,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902963917] [2024-11-10 05:31:47,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:31:47,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:31:47,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:31:47,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:31:47,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:31:47,508 INFO L87 Difference]: Start difference. First operand 228 states and 342 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:31:47,570 INFO L93 Difference]: Finished difference Result 470 states and 700 transitions. [2024-11-10 05:31:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:31:47,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-10 05:31:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:31:47,575 INFO L225 Difference]: With dead ends: 470 [2024-11-10 05:31:47,575 INFO L226 Difference]: Without dead ends: 245 [2024-11-10 05:31:47,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:31:47,576 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 51 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:31:47,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 209 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:31:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-10 05:31:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 188. [2024-11-10 05:31:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 124 states have internal predecessors, (158), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 05:31:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 278 transitions. [2024-11-10 05:31:47,600 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 278 transitions. Word has length 189 [2024-11-10 05:31:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:31:47,601 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 278 transitions. [2024-11-10 05:31:47,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 278 transitions. [2024-11-10 05:31:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 05:31:47,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:31:47,603 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:31:47,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 05:31:47,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:31:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:31:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1803480970, now seen corresponding path program 1 times [2024-11-10 05:31:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:31:47,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881197532] [2024-11-10 05:31:47,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:31:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:31:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:31:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:31:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:31:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:31:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:31:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:31:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:31:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:31:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:31:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:31:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:31:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:31:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 05:31:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:31:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 05:31:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:31:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 05:31:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:31:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 05:31:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:31:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 05:31:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 05:31:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 05:31:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:31:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 05:31:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 05:31:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 05:31:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:31:47,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:31:47,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881197532] [2024-11-10 05:31:47,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881197532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:31:47,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:31:47,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:31:47,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511740724] [2024-11-10 05:31:47,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:31:47,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:31:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:31:47,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:31:47,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:31:47,788 INFO L87 Difference]: Start difference. First operand 188 states and 278 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:31:47,838 INFO L93 Difference]: Finished difference Result 367 states and 545 transitions. [2024-11-10 05:31:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:31:47,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-10 05:31:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:31:47,842 INFO L225 Difference]: With dead ends: 367 [2024-11-10 05:31:47,842 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 05:31:47,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:31:47,844 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:31:47,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:31:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 05:31:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-10 05:31:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 125 states have (on average 1.28) internal successors, (160), 126 states have internal predecessors, (160), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 05:31:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 280 transitions. [2024-11-10 05:31:47,876 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 280 transitions. Word has length 189 [2024-11-10 05:31:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:31:47,876 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 280 transitions. [2024-11-10 05:31:47,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:31:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 280 transitions. [2024-11-10 05:31:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 05:31:47,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:31:47,879 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:31:47,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:31:47,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:31:47,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:31:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash 223592000, now seen corresponding path program 1 times [2024-11-10 05:31:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:31:47,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420929798] [2024-11-10 05:31:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:47,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:31:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:31:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:31:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:31:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:31:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:31:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:31:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:31:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:31:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:31:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:31:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:31:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 05:31:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 05:31:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 05:31:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 05:31:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 05:31:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 05:31:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 05:31:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 05:31:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 05:31:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 05:31:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 05:31:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 05:31:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 05:31:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:31:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 05:31:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 05:31:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 05:31:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 05:31:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:31:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420929798] [2024-11-10 05:31:48,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420929798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:31:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130014433] [2024-11-10 05:31:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:48,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:31:48,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:31:48,346 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 05:31:48,348 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 05:31:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:31:48,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 05:31:48,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:31:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 783 proven. 39 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-11-10 05:31:49,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:31:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 05:31:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130014433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:31:49,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:31:49,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2024-11-10 05:31:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222041201] [2024-11-10 05:31:49,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:31:49,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 05:31:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:31:49,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 05:31:49,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-10 05:31:49,518 INFO L87 Difference]: Start difference. First operand 190 states and 280 transitions. Second operand has 17 states, 17 states have (on average 7.764705882352941) internal successors, (132), 17 states have internal predecessors, (132), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) [2024-11-10 05:31:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:31:49,956 INFO L93 Difference]: Finished difference Result 301 states and 433 transitions. [2024-11-10 05:31:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 05:31:49,957 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.764705882352941) internal successors, (132), 17 states have internal predecessors, (132), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) Word has length 190 [2024-11-10 05:31:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:31:49,959 INFO L225 Difference]: With dead ends: 301 [2024-11-10 05:31:49,959 INFO L226 Difference]: Without dead ends: 210 [2024-11-10 05:31:49,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2024-11-10 05:31:49,961 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 226 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:31:49,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 342 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:31:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-10 05:31:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 198. [2024-11-10 05:31:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 131 states have (on average 1.2442748091603053) internal successors, (163), 132 states have internal predecessors, (163), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 05:31:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 283 transitions. [2024-11-10 05:31:49,992 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 283 transitions. Word has length 190 [2024-11-10 05:31:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:31:49,992 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 283 transitions. [2024-11-10 05:31:49,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.764705882352941) internal successors, (132), 17 states have internal predecessors, (132), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) [2024-11-10 05:31:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 283 transitions. [2024-11-10 05:31:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 05:31:49,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:31:49,996 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:31:50,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 05:31:50,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:31:50,197 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:31:50,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:31:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash 435573093, now seen corresponding path program 1 times [2024-11-10 05:31:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:31:50,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204892006] [2024-11-10 05:31:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:31:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:31:50,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961285671] [2024-11-10 05:31:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:31:50,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:31:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:31:50,272 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 05:31:50,274 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 05:31:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:31:50,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:31:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:31:50,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:31:50,621 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:31:50,623 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:31:50,644 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 05:31:50,825 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,SelfDestructingSolverStorable8 [2024-11-10 05:31:50,828 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:31:50,950 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:31:50,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:31:50 BoogieIcfgContainer [2024-11-10 05:31:50,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:31:50,955 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:31:50,955 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:31:50,955 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:31:50,956 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:31:44" (3/4) ... [2024-11-10 05:31:50,959 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:31:50,960 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:31:50,960 INFO L158 Benchmark]: Toolchain (without parser) took 8241.29ms. Allocated memory was 161.5MB in the beginning and 260.0MB in the end (delta: 98.6MB). Free memory was 104.9MB in the beginning and 109.9MB in the end (delta: -5.0MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2024-11-10 05:31:50,961 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:31:50,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.20ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 86.9MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 05:31:50,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.44ms. Allocated memory is still 161.5MB. Free memory was 86.9MB in the beginning and 81.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 05:31:50,962 INFO L158 Benchmark]: Boogie Preprocessor took 130.98ms. Allocated memory is still 161.5MB. Free memory was 81.0MB in the beginning and 129.8MB in the end (delta: -48.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-10 05:31:50,962 INFO L158 Benchmark]: IcfgBuilder took 720.41ms. Allocated memory is still 161.5MB. Free memory was 129.0MB in the beginning and 98.6MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 05:31:50,962 INFO L158 Benchmark]: TraceAbstraction took 6934.13ms. Allocated memory was 161.5MB in the beginning and 260.0MB in the end (delta: 98.6MB). Free memory was 97.8MB in the beginning and 109.9MB in the end (delta: -12.2MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2024-11-10 05:31:50,962 INFO L158 Benchmark]: Witness Printer took 4.73ms. Allocated memory is still 260.0MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:31:50,964 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.19ms. Allocated memory is still 161.5MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.20ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 86.9MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.44ms. Allocated memory is still 161.5MB. Free memory was 86.9MB in the beginning and 81.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.98ms. Allocated memory is still 161.5MB. Free memory was 81.0MB in the beginning and 129.8MB in the end (delta: -48.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * IcfgBuilder took 720.41ms. Allocated memory is still 161.5MB. Free memory was 129.0MB in the beginning and 98.6MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6934.13ms. Allocated memory was 161.5MB in the beginning and 260.0MB in the end (delta: 98.6MB). Free memory was 97.8MB in the beginning and 109.9MB in the end (delta: -12.2MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Witness Printer took 4.73ms. Allocated memory is still 260.0MB. Free memory is still 109.9MB. 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 someBinaryDOUBLEComparisonOperation at line 192, overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of someBinaryArithmeticDOUBLEoperation at line 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned long int var_1_28 = 256; [L47] double var_1_32 = 255.5; [L48] signed long int var_1_36 = 4; [L49] double var_1_38 = 63.6; [L50] double var_1_40 = 0.0; [L51] signed short int var_1_42 = 128; [L52] unsigned char var_1_45 = 0; [L53] unsigned char var_1_48 = 0; [L54] float var_1_49 = 256.5; [L55] unsigned long int var_1_50 = 100; [L56] double var_1_51 = 63.5; [L57] unsigned char var_1_52 = 50; [L58] unsigned char last_1_var_1_18 = 1; [L59] unsigned char last_1_var_1_20 = 100; VAL [isInitial=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L196] isInitial = 1 [L197] FCALL initially() [L198] COND TRUE 1 [L199] CALL updateLastVariables() [L188] last_1_var_1_18 = var_1_18 [L189] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L199] RET updateLastVariables() [L200] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L148] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L148] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L149] var_1_10 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L150] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L151] var_1_11 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L152] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L153] var_1_13 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L154] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L155] var_1_14 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L156] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L157] var_1_15 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L158] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L159] var_1_16 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L160] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L161] var_1_17 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L162] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L163] var_1_19 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L164] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L165] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L165] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L166] var_1_21 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L167] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L168] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L168] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L169] var_1_22 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L170] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L171] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L171] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L172] var_1_23 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L173] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L174] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L174] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L175] var_1_24 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L176] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L177] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L177] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L178] var_1_25 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L179] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L180] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L180] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L181] var_1_40 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_40 >= 4611686.018427382800e+12F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L182] RET assume_abort_if_not((var_1_40 >= 4611686.018427382800e+12F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L183] var_1_48 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_48 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L184] RET assume_abort_if_not(var_1_48 >= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L185] CALL assume_abort_if_not(var_1_48 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L185] RET assume_abort_if_not(var_1_48 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L200] RET updateVariables() [L201] CALL step() [L63] signed long int stepLocal_1 = last_1_var_1_20; [L64] unsigned char stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L65] COND TRUE stepLocal_0 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=256, var_1_9=1021/8] [L66] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1) [L69] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=256, var_1_8=256, var_1_9=1021/8] [L74] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=256, var_1_8=256, var_1_9=1021/8] [L79] var_1_36 = (((((var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) ? (var_1_8) : (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))))) + var_1_7) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=256, var_1_8=256, var_1_9=1021/8] [L80] COND FALSE !(0.83f > var_1_10) [L85] var_1_49 = var_1_10 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=256, var_1_8=256, var_1_9=1021/8] [L87] var_1_26 = var_1_16 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=256, var_1_8=256, var_1_9=1021/8] [L88] COND TRUE (var_1_25 - var_1_23) <= var_1_8 [L89] var_1_28 = var_1_23 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=511/2, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=256, var_1_8=256, var_1_9=1021/8] [L91] var_1_32 = ((((((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) > (var_1_16)) ? (((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) : (var_1_16))) [L92] var_1_50 = var_1_8 [L93] var_1_27 = 10u VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=127/2, var_1_52=50, var_1_7=256, var_1_8=256, var_1_9=1021/8] [L94] EXPR (var_1_8 * var_1_24) | var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=127/2, var_1_52=50, var_1_7=256, var_1_8=256, var_1_9=1021/8] [L94] COND TRUE ((var_1_8 * var_1_24) | var_1_7) <= (var_1_7 + 8u) [L95] COND TRUE ((((16u) < (var_1_7)) ? (16u) : (var_1_7))) < var_1_24 [L96] var_1_45 = var_1_19 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=127/2, var_1_52=50, var_1_7=256, var_1_8=256, var_1_9=1021/8] [L101] var_1_51 = var_1_11 [L102] var_1_52 = var_1_8 [L103] unsigned long int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=1021/8] [L104] COND TRUE stepLocal_2 != (var_1_8 + var_1_7) [L105] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L109] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L110] COND TRUE var_1_15 >= var_1_26 [L111] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L118] COND TRUE ! (var_1_11 >= (var_1_16 - var_1_40)) [L119] var_1_42 = (((((var_1_24 - 256)) < (var_1_24)) ? ((var_1_24 - 256)) : (var_1_24))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=-254, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L121] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=-254, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L122] COND FALSE !(! var_1_18) [L125] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=-254, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L130] EXPR -10 >> var_1_20 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=-254, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L130] COND TRUE 256 > (-10 >> var_1_20) [L131] var_1_38 = (var_1_16 - (((((var_1_40 - 128.375)) < (var_1_17)) ? ((var_1_40 - 128.375)) : (var_1_17)))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_3=0, var_1_42=-254, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L135] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17)) [L136] var_1_12 = (var_1_20 + var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=0, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_3=0, var_1_42=-254, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L201] RET step() [L202] CALL, EXPR property() [L192-L193] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; VAL [\result=0, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=0, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_3=0, var_1_42=-254, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L202] RET, EXPR property() [L202] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=0, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_3=0, var_1_42=-254, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=0, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=-129, var_1_22=127, var_1_23=127, var_1_24=2, var_1_25=258, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_3=0, var_1_42=-254, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=256, var_1_7=256, var_1_8=256, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 587 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 587 mSDsluCounter, 2367 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1266 mSDsCounter, 237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 556 IncrementalHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 237 mSolverCounterUnsat, 1101 mSDtfsCounter, 556 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 900 GetRequests, 864 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=5, InterpolantAutomatonStates: 34, 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, 8 MinimizatonAttempts, 136 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2073 NumberOfCodeBlocks, 2073 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1873 ConstructedInterpolants, 0 QuantifiedInterpolants, 3685 SizeOfPredicates, 4 NumberOfNonLiveVariables, 455 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 15003/15120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 05:31:51,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodestructure_filler-pr-ci_file-79.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 b80f3f9a0690b8b137c3e78a4bda741a5ebccde814b37d3c17d2da8a165237b2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:31:53,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:31:53,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:31:53,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:31:53,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:31:53,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:31:53,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:31:53,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:31:53,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:31:53,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:31:53,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:31:53,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:31:53,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:31:53,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:31:53,177 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:31:53,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:31:53,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:31:53,180 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:31:53,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:31:53,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:31:53,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:31:53,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:31:53,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:31:53,181 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:31:53,182 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:31:53,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:31:53,183 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:31:53,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:31:53,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:31:53,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:31:53,184 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:31:53,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:31:53,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:31:53,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:31:53,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:31:53,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:31:53,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:31:53,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:31:53,186 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:31:53,186 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:31:53,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:31:53,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:31:53,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:31:53,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:31:53,187 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 -> b80f3f9a0690b8b137c3e78a4bda741a5ebccde814b37d3c17d2da8a165237b2 [2024-11-10 05:31:53,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:31:53,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:31:53,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:31:53,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:31:53,511 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:31:53,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-11-10 05:31:55,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:31:55,292 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:31:55,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-11-10 05:31:55,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5fd0bd7b/bbf94e2c478c4ce48a2a28efefca4540/FLAG6dd803083 [2024-11-10 05:31:55,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5fd0bd7b/bbf94e2c478c4ce48a2a28efefca4540 [2024-11-10 05:31:55,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:31:55,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:31:55,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:31:55,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:31:55,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:31:55,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37fae7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55, skipping insertion in model container [2024-11-10 05:31:55,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:31:55,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i[919,932] [2024-11-10 05:31:55,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:31:55,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:31:55,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i[919,932] [2024-11-10 05:31:55,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:31:55,759 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:31:55,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55 WrapperNode [2024-11-10 05:31:55,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:31:55,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:31:55,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:31:55,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:31:55,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,820 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-10 05:31:55,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:31:55,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:31:55,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:31:55,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:31:55,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,855 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 05:31:55,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:31:55,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:31:55,880 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:31:55,880 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:31:55,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (1/1) ... [2024-11-10 05:31:55,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:31:55,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:31:55,923 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 05:31:55,925 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 05:31:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:31:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:31:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:31:55,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:31:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:31:55,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:31:56,059 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:31:56,062 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:32:05,850 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 05:32:05,851 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:32:05,870 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:32:05,870 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:32:05,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:32:05 BoogieIcfgContainer [2024-11-10 05:32:05,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:32:05,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:32:05,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:32:05,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:32:05,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:31:55" (1/3) ... [2024-11-10 05:32:05,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f05e4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:32:05, skipping insertion in model container [2024-11-10 05:32:05,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:31:55" (2/3) ... [2024-11-10 05:32:05,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f05e4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:32:05, skipping insertion in model container [2024-11-10 05:32:05,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:32:05" (3/3) ... [2024-11-10 05:32:05,887 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-11-10 05:32:05,904 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:32:05,905 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:32:05,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:32:05,990 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;@28eb2ee2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:32:05,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:32:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 05:32:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-10 05:32:06,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:32:06,012 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:32:06,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:32:06,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:32:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash 776830943, now seen corresponding path program 1 times [2024-11-10 05:32:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:32:06,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740100196] [2024-11-10 05:32:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:32:06,037 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 05:32:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:32:06,041 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 05:32:06,044 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 05:32:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:32:06,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:32:06,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:32:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-10 05:32:06,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:32:06,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:32:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740100196] [2024-11-10 05:32:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740100196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:32:06,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:32:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:32:06,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537709788] [2024-11-10 05:32:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:32:06,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:32:06,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:32:06,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:32:06,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:32:06,956 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 05:32:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:32:06,989 INFO L93 Difference]: Finished difference Result 170 states and 293 transitions. [2024-11-10 05:32:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:32:06,991 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 184 [2024-11-10 05:32:06,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:32:06,999 INFO L225 Difference]: With dead ends: 170 [2024-11-10 05:32:07,000 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 05:32:07,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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 05:32:07,009 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 05:32:07,011 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 05:32:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 05:32:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 05:32:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 05:32:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 127 transitions. [2024-11-10 05:32:07,057 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 127 transitions. Word has length 184 [2024-11-10 05:32:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:32:07,058 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 127 transitions. [2024-11-10 05:32:07,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 05:32:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 127 transitions. [2024-11-10 05:32:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-10 05:32:07,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:32:07,062 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:32:07,082 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 05:32:07,263 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 05:32:07,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:32:07,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:32:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash 869646119, now seen corresponding path program 1 times [2024-11-10 05:32:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:32:07,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47583523] [2024-11-10 05:32:07,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:32:07,266 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 05:32:07,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:32:07,268 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 05:32:07,269 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 05:32:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:32:07,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 05:32:07,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:32:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:32:09,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:32:09,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:32:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47583523] [2024-11-10 05:32:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47583523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:32:09,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:32:09,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:32:09,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089069853] [2024-11-10 05:32:09,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:32:09,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:32:09,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:32:09,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:32:09,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:32:09,705 INFO L87 Difference]: Start difference. First operand 84 states and 127 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:32:14,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:32:16,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:32:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:32:16,876 INFO L93 Difference]: Finished difference Result 272 states and 413 transitions. [2024-11-10 05:32:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:32:16,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-11-10 05:32:16,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:32:16,885 INFO L225 Difference]: With dead ends: 272 [2024-11-10 05:32:16,885 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 05:32:16,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:32:16,889 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 134 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:32:16,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 440 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 81 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2024-11-10 05:32:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 05:32:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 162. [2024-11-10 05:32:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 103 states have internal predecessors, (134), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 05:32:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 246 transitions. [2024-11-10 05:32:16,933 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 246 transitions. Word has length 184 [2024-11-10 05:32:16,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:32:16,935 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 246 transitions. [2024-11-10 05:32:16,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:32:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 246 transitions. [2024-11-10 05:32:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 05:32:16,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:32:16,938 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:32:16,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 05:32:17,139 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 05:32:17,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:32:17,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:32:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash -299089147, now seen corresponding path program 1 times [2024-11-10 05:32:17,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:32:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685062388] [2024-11-10 05:32:17,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:32:17,141 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 05:32:17,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:32:17,143 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 05:32:17,144 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 05:32:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:32:17,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 05:32:17,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:32:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:32:19,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:32:19,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:32:19,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685062388] [2024-11-10 05:32:19,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685062388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:32:19,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:32:19,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:32:19,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491168989] [2024-11-10 05:32:19,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:32:19,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:32:19,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:32:19,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:32:19,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:32:19,083 INFO L87 Difference]: Start difference. First operand 162 states and 246 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:32:22,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:32:25,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:32:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:32:25,627 INFO L93 Difference]: Finished difference Result 427 states and 648 transitions. [2024-11-10 05:32:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:32:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-10 05:32:25,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:32:25,636 INFO L225 Difference]: With dead ends: 427 [2024-11-10 05:32:25,637 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 05:32:25,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:32:25,640 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 91 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:32:25,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 422 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-10 05:32:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 05:32:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 217. [2024-11-10 05:32:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 129 states have (on average 1.2403100775193798) internal successors, (160), 129 states have internal predecessors, (160), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 05:32:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 328 transitions. [2024-11-10 05:32:25,682 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 328 transitions. Word has length 186 [2024-11-10 05:32:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:32:25,683 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 328 transitions. [2024-11-10 05:32:25,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:32:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 328 transitions. [2024-11-10 05:32:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 05:32:25,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:32:25,686 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:32:25,713 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 (4)] Forceful destruction successful, exit code 0 [2024-11-10 05:32:25,886 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 05:32:25,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:32:25,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:32:25,888 INFO L85 PathProgramCache]: Analyzing trace with hash -87738234, now seen corresponding path program 1 times [2024-11-10 05:32:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:32:25,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133823481] [2024-11-10 05:32:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:32:25,889 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 05:32:25,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:32:25,891 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 05:32:25,892 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 05:32:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:32:26,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:32:26,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:32:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:32:26,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:32:26,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:32:26,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133823481] [2024-11-10 05:32:26,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133823481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:32:26,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:32:26,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:32:26,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545697532] [2024-11-10 05:32:26,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:32:26,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:32:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:32:26,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:32:26,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:32:26,707 INFO L87 Difference]: Start difference. First operand 217 states and 328 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:32:30,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:32:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:32:30,573 INFO L93 Difference]: Finished difference Result 384 states and 577 transitions. [2024-11-10 05:32:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:32:30,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-10 05:32:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:32:30,581 INFO L225 Difference]: With dead ends: 384 [2024-11-10 05:32:30,582 INFO L226 Difference]: Without dead ends: 225 [2024-11-10 05:32:30,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:32:30,586 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 44 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:32:30,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 206 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-10 05:32:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-10 05:32:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-11-10 05:32:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 135 states have (on average 1.2148148148148148) internal successors, (164), 135 states have internal predecessors, (164), 84 states have call successors, (84), 5 states have call predecessors, (84), 5 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 05:32:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 332 transitions. [2024-11-10 05:32:30,633 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 332 transitions. Word has length 186 [2024-11-10 05:32:30,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:32:30,635 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 332 transitions. [2024-11-10 05:32:30,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:32:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 332 transitions. [2024-11-10 05:32:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 05:32:30,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:32:30,641 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:32:30,679 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 (5)] Ended with exit code 0 [2024-11-10 05:32:30,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:32:30,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:32:30,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:32:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash 252012927, now seen corresponding path program 1 times [2024-11-10 05:32:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:32:30,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636253921] [2024-11-10 05:32:30,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:32:30,852 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 05:32:30,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:32:30,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:32:30,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 05:32:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:32:31,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 05:32:31,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:32:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 783 proven. 39 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-11-10 05:32:32,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:32:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 05:32:33,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:32:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636253921] [2024-11-10 05:32:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636253921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:32:33,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:32:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-10 05:32:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239040190] [2024-11-10 05:32:33,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:32:33,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 05:32:33,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:32:33,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 05:32:33,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:32:33,422 INFO L87 Difference]: Start difference. First operand 225 states and 332 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-10 05:32:38,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:32:40,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:32:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:32:40,187 INFO L93 Difference]: Finished difference Result 338 states and 483 transitions. [2024-11-10 05:32:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 05:32:40,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 187 [2024-11-10 05:32:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:32:40,235 INFO L225 Difference]: With dead ends: 338 [2024-11-10 05:32:40,235 INFO L226 Difference]: Without dead ends: 253 [2024-11-10 05:32:40,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-10 05:32:40,237 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 171 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 117 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:32:40,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 207 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 161 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2024-11-10 05:32:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-10 05:32:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 237. [2024-11-10 05:32:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 144 states have (on average 1.1875) internal successors, (171), 144 states have internal predecessors, (171), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 05:32:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 339 transitions. [2024-11-10 05:32:40,266 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 339 transitions. Word has length 187 [2024-11-10 05:32:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:32:40,267 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 339 transitions. [2024-11-10 05:32:40,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-10 05:32:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 339 transitions. [2024-11-10 05:32:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 05:32:40,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:32:40,270 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:32:40,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 05:32:40,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:32:40,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:32:40,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:32:40,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1587260258, now seen corresponding path program 1 times [2024-11-10 05:32:40,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:32:40,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196185796] [2024-11-10 05:32:40,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:32:40,472 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 05:32:40,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:32:40,474 INFO L229 MonitoredProcess]: Starting monitored process 7 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 05:32:40,475 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 (7)] Waiting until timeout for monitored process [2024-11-10 05:32:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:32:41,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 05:32:41,063 INFO L278 TraceCheckSpWp]: Computing forward predicates...