./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.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 ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:55:25,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:55:26,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:55:26,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:55:26,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:55:26,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:55:26,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:55:26,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:55:26,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:55:26,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:55:26,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:55:26,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:55:26,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:55:26,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:55:26,056 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:55:26,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:55:26,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:55:26,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:55:26,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:55:26,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:55:26,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:55:26,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:55:26,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:55:26,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:55:26,061 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:55:26,061 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:55:26,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:55:26,062 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:55:26,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:55:26,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:55:26,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:55:26,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:55:26,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:55:26,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:55:26,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:55:26,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:55:26,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:55:26,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:55:26,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:55:26,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:55:26,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:55:26,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:55:26,067 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 -> ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac [2024-10-13 03:55:26,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:55:26,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:55:26,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:55:26,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:55:26,387 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:55:26,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-10-13 03:55:27,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:55:28,072 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:55:28,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-10-13 03:55:28,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f7528d8/3878a27d2cf6454eb83c8dd404a8095b/FLAG078eb10db [2024-10-13 03:55:28,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f7528d8/3878a27d2cf6454eb83c8dd404a8095b [2024-10-13 03:55:28,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:55:28,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:55:28,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:55:28,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:55:28,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:55:28,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1271341f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28, skipping insertion in model container [2024-10-13 03:55:28,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:55:28,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-10-13 03:55:28,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:55:28,426 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:55:28,439 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-10-13 03:55:28,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:55:28,533 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:55:28,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28 WrapperNode [2024-10-13 03:55:28,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:55:28,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:55:28,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:55:28,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:55:28,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,613 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-10-13 03:55:28,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:55:28,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:55:28,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:55:28,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:55:28,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,671 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-10-13 03:55:28,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:55:28,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:55:28,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:55:28,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:55:28,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (1/1) ... [2024-10-13 03:55:28,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:55:28,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:55:28,762 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-10-13 03:55:28,798 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-10-13 03:55:28,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:55:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:55:28,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:55:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:55:28,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:55:28,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:55:28,955 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:55:28,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:55:29,529 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-13 03:55:29,530 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:55:29,569 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:55:29,570 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:55:29,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:55:29 BoogieIcfgContainer [2024-10-13 03:55:29,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:55:29,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:55:29,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:55:29,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:55:29,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:55:28" (1/3) ... [2024-10-13 03:55:29,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2938648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:55:29, skipping insertion in model container [2024-10-13 03:55:29,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:55:28" (2/3) ... [2024-10-13 03:55:29,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2938648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:55:29, skipping insertion in model container [2024-10-13 03:55:29,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:55:29" (3/3) ... [2024-10-13 03:55:29,581 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-22.i [2024-10-13 03:55:29,598 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:55:29,598 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:55:29,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:55:29,680 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;@4f737318, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:55:29,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:55:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-13 03:55:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-13 03:55:29,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:55:29,706 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:55:29,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:55:29,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:55:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1994725387, now seen corresponding path program 1 times [2024-10-13 03:55:29,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:55:29,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139373066] [2024-10-13 03:55:29,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:29,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:55:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:55:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:55:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:55:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:55:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:55:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:55:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:55:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:55:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:55:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:55:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:55:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:55:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:55:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:55:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:55:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:55:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:55:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:55:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:55:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:55:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:55:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:55:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:55:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:55:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 03:55:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:55:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 03:55:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:55:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:55:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:55:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:55:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:55:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:55:30,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139373066] [2024-10-13 03:55:30,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139373066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:55:30,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:55:30,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:55:30,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049259388] [2024-10-13 03:55:30,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:55:30,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:55:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:55:30,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:55:30,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:55:30,856 INFO L87 Difference]: Start difference. First operand has 95 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:55:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:55:31,298 INFO L93 Difference]: Finished difference Result 314 states and 571 transitions. [2024-10-13 03:55:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:55:31,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-13 03:55:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:55:31,316 INFO L225 Difference]: With dead ends: 314 [2024-10-13 03:55:31,317 INFO L226 Difference]: Without dead ends: 220 [2024-10-13 03:55:31,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:55:31,326 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 194 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:55:31,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 651 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:55:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-13 03:55:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 206. [2024-10-13 03:55:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 141 states have (on average 1.4397163120567376) internal successors, (203), 141 states have internal predecessors, (203), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 03:55:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 327 transitions. [2024-10-13 03:55:31,418 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 327 transitions. Word has length 195 [2024-10-13 03:55:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:55:31,419 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 327 transitions. [2024-10-13 03:55:31,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:55:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 327 transitions. [2024-10-13 03:55:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 03:55:31,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:55:31,425 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:55:31,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:55:31,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:55:31,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:55:31,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1691812129, now seen corresponding path program 1 times [2024-10-13 03:55:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:55:31,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906672065] [2024-10-13 03:55:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:31,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:55:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:31,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:55:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:31,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:55:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:55:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:55:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:55:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:55:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:55:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:55:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:31,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:55:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:55:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:55:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:55:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:55:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:55:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:55:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:55:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:55:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:55:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:55:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:55:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:55:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:55:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:55:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:55:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 03:55:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:55:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 03:55:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:55:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:55:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:55:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:55:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:55:32,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:55:32,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906672065] [2024-10-13 03:55:32,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906672065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:55:32,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:55:32,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:55:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128954928] [2024-10-13 03:55:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:55:32,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:55:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:55:32,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:55:32,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:55:32,171 INFO L87 Difference]: Start difference. First operand 206 states and 327 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:55:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:55:32,472 INFO L93 Difference]: Finished difference Result 537 states and 848 transitions. [2024-10-13 03:55:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:55:32,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-13 03:55:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:55:32,479 INFO L225 Difference]: With dead ends: 537 [2024-10-13 03:55:32,480 INFO L226 Difference]: Without dead ends: 332 [2024-10-13 03:55:32,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:55:32,486 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 116 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:55:32,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 395 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:55:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-13 03:55:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 308. [2024-10-13 03:55:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 211 states have (on average 1.4407582938388626) internal successors, (304), 211 states have internal predecessors, (304), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-13 03:55:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 490 transitions. [2024-10-13 03:55:32,575 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 490 transitions. Word has length 196 [2024-10-13 03:55:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:55:32,575 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 490 transitions. [2024-10-13 03:55:32,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:55:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 490 transitions. [2024-10-13 03:55:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 03:55:32,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:55:32,582 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:55:32,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:55:32,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:55:32,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:55:32,583 INFO L85 PathProgramCache]: Analyzing trace with hash -242608641, now seen corresponding path program 1 times [2024-10-13 03:55:32,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:55:32,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735092817] [2024-10-13 03:55:32,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:55:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:34,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:55:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:55:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:34,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:55:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:34,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:55:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:34,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:55:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:55:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:55:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:55:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:55:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:55:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:55:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:55:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:55:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:55:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:55:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:55:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:55:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:55:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:55:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:55:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:55:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:55:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:55:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:55:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 03:55:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:55:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 03:55:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:55:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:55:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:55:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:55:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:55:35,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:55:35,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735092817] [2024-10-13 03:55:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735092817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:55:35,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:55:35,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:55:35,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066154538] [2024-10-13 03:55:35,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:55:35,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:55:35,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:55:35,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:55:35,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:55:35,144 INFO L87 Difference]: Start difference. First operand 308 states and 490 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:55:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:55:35,730 INFO L93 Difference]: Finished difference Result 780 states and 1244 transitions. [2024-10-13 03:55:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:55:35,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-10-13 03:55:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:55:35,736 INFO L225 Difference]: With dead ends: 780 [2024-10-13 03:55:35,738 INFO L226 Difference]: Without dead ends: 559 [2024-10-13 03:55:35,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:55:35,741 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 81 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:55:35,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 442 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:55:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-13 03:55:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 552. [2024-10-13 03:55:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 391 states have (on average 1.4475703324808185) internal successors, (566), 391 states have internal predecessors, (566), 155 states have call successors, (155), 5 states have call predecessors, (155), 5 states have return successors, (155), 155 states have call predecessors, (155), 155 states have call successors, (155) [2024-10-13 03:55:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 876 transitions. [2024-10-13 03:55:35,844 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 876 transitions. Word has length 200 [2024-10-13 03:55:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:55:35,845 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 876 transitions. [2024-10-13 03:55:35,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:55:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 876 transitions. [2024-10-13 03:55:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 03:55:35,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:55:35,853 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:55:35,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:55:35,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:55:35,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:55:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash -829414655, now seen corresponding path program 1 times [2024-10-13 03:55:35,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:55:35,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873243485] [2024-10-13 03:55:35,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:35,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:55:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:55:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:55:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:55:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:55:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:55:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:55:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:55:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:55:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:55:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:55:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:55:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:55:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:55:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:55:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:55:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:55:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:55:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:55:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:55:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:55:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:55:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:55:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:55:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:55:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 03:55:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:55:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 03:55:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:55:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:55:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:55:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:55:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:55:36,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:55:36,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873243485] [2024-10-13 03:55:36,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873243485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:55:36,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:55:36,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:55:36,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773834904] [2024-10-13 03:55:36,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:55:36,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:55:36,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:55:36,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:55:36,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:55:36,599 INFO L87 Difference]: Start difference. First operand 552 states and 876 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:55:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:55:36,871 INFO L93 Difference]: Finished difference Result 1397 states and 2214 transitions. [2024-10-13 03:55:36,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:55:36,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-10-13 03:55:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:55:36,879 INFO L225 Difference]: With dead ends: 1397 [2024-10-13 03:55:36,880 INFO L226 Difference]: Without dead ends: 952 [2024-10-13 03:55:36,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 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-10-13 03:55:36,884 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 215 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:55:36,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 498 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:55:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-10-13 03:55:36,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 792. [2024-10-13 03:55:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 567 states have (on average 1.4514991181657848) internal successors, (823), 567 states have internal predecessors, (823), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2024-10-13 03:55:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1257 transitions. [2024-10-13 03:55:36,990 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1257 transitions. Word has length 200 [2024-10-13 03:55:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:55:36,990 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1257 transitions. [2024-10-13 03:55:36,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:55:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1257 transitions. [2024-10-13 03:55:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 03:55:36,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:55:36,993 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:55:36,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:55:36,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:55:36,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:55:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash -616274517, now seen corresponding path program 1 times [2024-10-13 03:55:36,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:55:36,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021478110] [2024-10-13 03:55:36,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:36,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:55:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:55:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:55:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:55:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:55:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:55:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:55:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:55:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:55:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:55:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:55:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:55:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:55:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:55:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:55:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:55:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:55:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:55:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:55:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:55:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:55:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:55:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:55:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:55:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:55:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 03:55:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:55:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 03:55:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:55:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:55:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:55:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:55:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:55:37,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:55:37,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021478110] [2024-10-13 03:55:37,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021478110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:55:37,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:55:37,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:55:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268834220] [2024-10-13 03:55:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:55:37,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:55:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:55:37,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:55:37,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:55:37,350 INFO L87 Difference]: Start difference. First operand 792 states and 1257 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:55:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:55:37,488 INFO L93 Difference]: Finished difference Result 1923 states and 3051 transitions. [2024-10-13 03:55:37,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:55:37,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-10-13 03:55:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:55:37,496 INFO L225 Difference]: With dead ends: 1923 [2024-10-13 03:55:37,497 INFO L226 Difference]: Without dead ends: 1232 [2024-10-13 03:55:37,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:55:37,500 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 83 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:55:37,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 484 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:55:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2024-10-13 03:55:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 890. [2024-10-13 03:55:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 665 states have (on average 1.443609022556391) internal successors, (960), 665 states have internal predecessors, (960), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2024-10-13 03:55:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1394 transitions. [2024-10-13 03:55:37,590 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1394 transitions. Word has length 201 [2024-10-13 03:55:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:55:37,591 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1394 transitions. [2024-10-13 03:55:37,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:55:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1394 transitions. [2024-10-13 03:55:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 03:55:37,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:55:37,594 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:55:37,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:55:37,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:55:37,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:55:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1684548073, now seen corresponding path program 1 times [2024-10-13 03:55:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:55:37,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352531242] [2024-10-13 03:55:37,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:55:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:55:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:55:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:55:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:55:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:55:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:55:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:55:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:55:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:55:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:55:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:55:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:55:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:55:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:55:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:55:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:55:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:55:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:55:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:55:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:55:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:55:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:55:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:55:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:55:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 03:55:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:55:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 03:55:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:55:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:55:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:55:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:55:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-13 03:55:39,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:55:39,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352531242] [2024-10-13 03:55:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352531242] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:55:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870320146] [2024-10-13 03:55:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:39,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:55:39,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:55:39,426 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-10-13 03:55:39,427 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-10-13 03:55:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:39,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 03:55:39,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:55:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 828 proven. 27 refuted. 0 times theorem prover too weak. 1005 trivial. 0 not checked. [2024-10-13 03:55:41,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:55:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-13 03:55:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870320146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:55:42,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:55:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2024-10-13 03:55:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208877826] [2024-10-13 03:55:42,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:55:42,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 03:55:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:55:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 03:55:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2024-10-13 03:55:42,771 INFO L87 Difference]: Start difference. First operand 890 states and 1394 transitions. Second operand has 26 states, 25 states have (on average 5.32) internal successors, (133), 26 states have internal predecessors, (133), 7 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 7 states have call successors, (93) [2024-10-13 03:55:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:55:45,112 INFO L93 Difference]: Finished difference Result 2436 states and 3750 transitions. [2024-10-13 03:55:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 03:55:45,113 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.32) internal successors, (133), 26 states have internal predecessors, (133), 7 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 7 states have call successors, (93) Word has length 201 [2024-10-13 03:55:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:55:45,123 INFO L225 Difference]: With dead ends: 2436 [2024-10-13 03:55:45,124 INFO L226 Difference]: Without dead ends: 1729 [2024-10-13 03:55:45,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 450 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=457, Invalid=1265, Unknown=0, NotChecked=0, Total=1722 [2024-10-13 03:55:45,129 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 423 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:55:45,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1315 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 03:55:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2024-10-13 03:55:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1422. [2024-10-13 03:55:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1059 states have (on average 1.4192634560906516) internal successors, (1503), 1059 states have internal predecessors, (1503), 341 states have call successors, (341), 21 states have call predecessors, (341), 21 states have return successors, (341), 341 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-13 03:55:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2185 transitions. [2024-10-13 03:55:45,314 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2185 transitions. Word has length 201 [2024-10-13 03:55:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:55:45,315 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2185 transitions. [2024-10-13 03:55:45,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.32) internal successors, (133), 26 states have internal predecessors, (133), 7 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 7 states have call successors, (93) [2024-10-13 03:55:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2185 transitions. [2024-10-13 03:55:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 03:55:45,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:55:45,319 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:55:45,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 03:55:45,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 03:55:45,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:55:45,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:55:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1313308260, now seen corresponding path program 1 times [2024-10-13 03:55:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:55:45,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111467746] [2024-10-13 03:55:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:55:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:55:45,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116897021] [2024-10-13 03:55:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:55:45,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:55:45,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:55:45,820 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-10-13 03:55:45,822 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-10-13 03:55:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:55:46,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-13 03:55:46,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:55:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1531 proven. 135 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-10-13 03:55:51,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:56:02,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:56:02,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111467746] [2024-10-13 03:56:02,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 03:56:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116897021] [2024-10-13 03:56:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116897021] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:56:02,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 03:56:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2024-10-13 03:56:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235943064] [2024-10-13 03:56:02,641 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 03:56:02,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 03:56:02,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:56:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 03:56:02,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=3002, Unknown=0, NotChecked=0, Total=3660 [2024-10-13 03:56:02,647 INFO L87 Difference]: Start difference. First operand 1422 states and 2185 transitions. Second operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 44 states have internal predecessors, (100), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) [2024-10-13 03:56:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:06,864 INFO L93 Difference]: Finished difference Result 2214 states and 3304 transitions. [2024-10-13 03:56:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-10-13 03:56:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 44 states have internal predecessors, (100), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) Word has length 201 [2024-10-13 03:56:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:06,886 INFO L225 Difference]: With dead ends: 2214 [2024-10-13 03:56:06,887 INFO L226 Difference]: Without dead ends: 1972 [2024-10-13 03:56:06,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3404 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2252, Invalid=10404, Unknown=0, NotChecked=0, Total=12656 [2024-10-13 03:56:06,895 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 548 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:06,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1690 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 03:56:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2024-10-13 03:56:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1850. [2024-10-13 03:56:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1375 states have (on average 1.384) internal successors, (1903), 1383 states have internal predecessors, (1903), 431 states have call successors, (431), 43 states have call predecessors, (431), 43 states have return successors, (431), 423 states have call predecessors, (431), 431 states have call successors, (431) [2024-10-13 03:56:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2765 transitions. [2024-10-13 03:56:07,118 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2765 transitions. Word has length 201 [2024-10-13 03:56:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:07,119 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2765 transitions. [2024-10-13 03:56:07,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 44 states have internal predecessors, (100), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) [2024-10-13 03:56:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2765 transitions. [2024-10-13 03:56:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 03:56:07,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:07,124 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:07,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 03:56:07,326 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,SelfDestructingSolverStorable6 [2024-10-13 03:56:07,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:07,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash -33444582, now seen corresponding path program 1 times [2024-10-13 03:56:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837825456] [2024-10-13 03:56:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:56:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:56:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:56:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:56:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:56:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:56:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:56:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:56:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:56:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:56:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:56:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:56:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:56:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:56:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:56:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:56:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:56:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:56:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:56:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:56:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:56:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:56:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:56:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:56:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 03:56:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:56:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 03:56:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:56:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:56:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:56:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:56:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:56:07,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:56:07,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837825456] [2024-10-13 03:56:07,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837825456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:07,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:07,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:56:07,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247095223] [2024-10-13 03:56:07,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:07,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:56:07,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:56:07,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:56:07,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:56:07,493 INFO L87 Difference]: Start difference. First operand 1850 states and 2765 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:07,684 INFO L93 Difference]: Finished difference Result 3820 states and 5744 transitions. [2024-10-13 03:56:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:56:07,685 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-10-13 03:56:07,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:07,703 INFO L225 Difference]: With dead ends: 3820 [2024-10-13 03:56:07,703 INFO L226 Difference]: Without dead ends: 2292 [2024-10-13 03:56:07,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-10-13 03:56:07,714 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 38 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:07,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 278 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:56:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2024-10-13 03:56:07,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2107. [2024-10-13 03:56:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1632 states have (on average 1.3829656862745099) internal successors, (2257), 1640 states have internal predecessors, (2257), 431 states have call successors, (431), 43 states have call predecessors, (431), 43 states have return successors, (431), 423 states have call predecessors, (431), 431 states have call successors, (431) [2024-10-13 03:56:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 3119 transitions. [2024-10-13 03:56:07,988 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 3119 transitions. Word has length 201 [2024-10-13 03:56:07,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:07,989 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 3119 transitions. [2024-10-13 03:56:07,989 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 3119 transitions. [2024-10-13 03:56:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 03:56:07,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:07,995 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:07,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:56:07,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1453856870, now seen corresponding path program 1 times [2024-10-13 03:56:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069026181] [2024-10-13 03:56:07,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:56:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:56:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:56:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:56:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:56:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:56:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:56:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:56:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:56:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:56:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:56:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:56:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:56:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:56:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:56:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:56:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:56:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:56:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:56:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:56:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:56:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:56:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:56:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:56:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 03:56:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:56:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 03:56:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:56:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:56:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:56:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:56:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:56:08,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:56:08,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069026181] [2024-10-13 03:56:08,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069026181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:08,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:08,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:56:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443076453] [2024-10-13 03:56:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:08,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:56:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:56:08,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:56:08,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:56:08,392 INFO L87 Difference]: Start difference. First operand 2107 states and 3119 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:08,893 INFO L93 Difference]: Finished difference Result 3687 states and 5485 transitions. [2024-10-13 03:56:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:56:08,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-10-13 03:56:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:08,915 INFO L225 Difference]: With dead ends: 3687 [2024-10-13 03:56:08,916 INFO L226 Difference]: Without dead ends: 2713 [2024-10-13 03:56:08,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:56:08,922 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 172 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:08,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 622 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:56:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2024-10-13 03:56:09,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2495. [2024-10-13 03:56:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 1872 states have (on average 1.357905982905983) internal successors, (2542), 1884 states have internal predecessors, (2542), 569 states have call successors, (569), 53 states have call predecessors, (569), 53 states have return successors, (569), 557 states have call predecessors, (569), 569 states have call successors, (569) [2024-10-13 03:56:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3680 transitions. [2024-10-13 03:56:09,272 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3680 transitions. Word has length 201 [2024-10-13 03:56:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:09,274 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 3680 transitions. [2024-10-13 03:56:09,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3680 transitions. [2024-10-13 03:56:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-13 03:56:09,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:09,279 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:09,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:56:09,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:09,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash 365975901, now seen corresponding path program 1 times [2024-10-13 03:56:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:56:09,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157265571] [2024-10-13 03:56:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:56:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:56:09,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2147030413] [2024-10-13 03:56:09,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:09,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:56:09,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:56:09,678 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:56:09,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 03:56:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:56:09,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:56:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:56:10,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:56:10,138 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:56:10,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:56:10,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 03:56:10,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:56:10,347 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:56:10,508 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:56:10,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:56:10 BoogieIcfgContainer [2024-10-13 03:56:10,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:56:10,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:56:10,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:56:10,512 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:56:10,512 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:55:29" (3/4) ... [2024-10-13 03:56:10,514 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:56:10,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:56:10,516 INFO L158 Benchmark]: Toolchain (without parser) took 42398.09ms. Allocated memory was 157.3MB in the beginning and 979.4MB in the end (delta: 822.1MB). Free memory was 101.4MB in the beginning and 702.7MB in the end (delta: -601.2MB). Peak memory consumption was 221.3MB. Max. memory is 16.1GB. [2024-10-13 03:56:10,516 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:56:10,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.25ms. Allocated memory is still 157.3MB. Free memory was 101.0MB in the beginning and 82.5MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 03:56:10,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.47ms. Allocated memory is still 157.3MB. Free memory was 82.5MB in the beginning and 76.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:56:10,517 INFO L158 Benchmark]: Boogie Preprocessor took 107.38ms. Allocated memory is still 157.3MB. Free memory was 76.3MB in the beginning and 65.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 03:56:10,517 INFO L158 Benchmark]: RCFGBuilder took 848.10ms. Allocated memory was 157.3MB in the beginning and 220.2MB in the end (delta: 62.9MB). Free memory was 65.4MB in the beginning and 154.1MB in the end (delta: -88.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-13 03:56:10,517 INFO L158 Benchmark]: TraceAbstraction took 40937.05ms. Allocated memory was 220.2MB in the beginning and 979.4MB in the end (delta: 759.2MB). Free memory was 153.1MB in the beginning and 702.7MB in the end (delta: -549.6MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. [2024-10-13 03:56:10,518 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 979.4MB. Free memory is still 702.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:56:10,519 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.25ms. Allocated memory is still 157.3MB. Free memory was 101.0MB in the beginning and 82.5MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.47ms. Allocated memory is still 157.3MB. Free memory was 82.5MB in the beginning and 76.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.38ms. Allocated memory is still 157.3MB. Free memory was 76.3MB in the beginning and 65.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 848.10ms. Allocated memory was 157.3MB in the beginning and 220.2MB in the end (delta: 62.9MB). Free memory was 65.4MB in the beginning and 154.1MB in the end (delta: -88.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40937.05ms. Allocated memory was 220.2MB in the beginning and 979.4MB in the end (delta: 759.2MB). Free memory was 153.1MB in the beginning and 702.7MB in the end (delta: -549.6MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 979.4MB. Free memory is still 702.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 204, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of bitwiseOr at line 204. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed short int var_1_6 = -1; [L24] unsigned char var_1_7 = 1; [L25] unsigned char var_1_8 = 1; [L26] signed char var_1_9 = -128; [L27] signed char var_1_12 = 10; [L28] signed char var_1_13 = -64; [L29] signed char var_1_14 = 1; [L30] signed char var_1_15 = -25; [L31] unsigned short int var_1_16 = 256; [L32] signed char var_1_18 = 4; [L33] float var_1_19 = 100.5; [L34] float var_1_20 = 4.5; [L35] signed char var_1_21 = 0; [L36] signed char var_1_22 = 64; [L37] signed char var_1_23 = 2; [L38] signed char var_1_24 = 4; [L39] unsigned long int var_1_25 = 8; [L40] unsigned char var_1_27 = 50; [L41] unsigned char var_1_28 = 5; [L42] signed short int var_1_29 = 32; [L43] signed long int var_1_30 = 1; [L44] signed long int var_1_31 = 0; [L45] unsigned char var_1_33 = 2; [L46] unsigned char var_1_34 = 128; [L47] unsigned char var_1_35 = 2; [L48] unsigned char var_1_36 = 200; [L49] unsigned char var_1_37 = 32; [L50] double var_1_38 = 10.3; [L51] signed short int var_1_39 = -256; [L52] signed short int last_1_var_1_6 = -1; [L53] signed char last_1_var_1_9 = -128; [L54] unsigned short int last_1_var_1_16 = 256; [L55] signed char last_1_var_1_18 = 4; [L56] float last_1_var_1_19 = 100.5; [L57] unsigned long int last_1_var_1_25 = 8; [L58] unsigned char last_1_var_1_27 = 50; [L59] signed short int last_1_var_1_29 = 32; [L60] unsigned char last_1_var_1_33 = 2; [L61] unsigned char last_1_var_1_35 = 2; [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] CALL updateLastVariables() [L192] last_1_var_1_6 = var_1_6 [L193] last_1_var_1_9 = var_1_9 [L194] last_1_var_1_16 = var_1_16 [L195] last_1_var_1_18 = var_1_18 [L196] last_1_var_1_19 = var_1_19 [L197] last_1_var_1_25 = var_1_25 [L198] last_1_var_1_27 = var_1_27 [L199] last_1_var_1_29 = var_1_29 [L200] last_1_var_1_33 = var_1_33 [L201] last_1_var_1_35 = var_1_35 [L211] RET updateLastVariables() [L212] CALL updateVariables() [L143] var_1_7 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L145] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L145] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [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_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L148] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L148] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L149] var_1_12 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L150] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L151] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L151] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L152] var_1_13 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L153] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L154] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L154] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L155] var_1_14 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L156] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L157] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L157] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L158] var_1_15 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L159] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L160] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L160] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L161] var_1_20 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L162] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L163] var_1_22 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L164] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L165] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L165] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L166] var_1_23 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L168] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L168] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L169] var_1_24 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L170] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L171] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L171] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L172] var_1_28 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L173] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L174] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L174] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L175] var_1_30 = __VERIFIER_nondet_long() [L176] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L176] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L177] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L177] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L178] var_1_31 = __VERIFIER_nondet_long() [L179] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L179] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L181] var_1_34 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_34 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L182] RET assume_abort_if_not(var_1_34 >= 127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L183] CALL assume_abort_if_not(var_1_34 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L183] RET assume_abort_if_not(var_1_34 <= 254) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L184] var_1_36 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_36 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L185] RET assume_abort_if_not(var_1_36 >= 190) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L186] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L186] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L187] var_1_37 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_37 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L188] RET assume_abort_if_not(var_1_37 >= 31) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L189] CALL assume_abort_if_not(var_1_37 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L189] RET assume_abort_if_not(var_1_37 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L212] RET updateVariables() [L213] CALL step() [L65] signed long int stepLocal_0 = 50 * last_1_var_1_29; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L66] EXPR last_1_var_1_16 | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L66] COND FALSE !((last_1_var_1_16 | last_1_var_1_9) >= stepLocal_0) [L69] COND FALSE !((last_1_var_1_19 + last_1_var_1_19) > 200.875f) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L76] signed long int stepLocal_4 = last_1_var_1_9; [L77] signed long int stepLocal_3 = var_1_24 % var_1_34; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=63, stepLocal_4=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L78] COND FALSE !(last_1_var_1_16 <= stepLocal_4) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=63, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L81] COND TRUE stepLocal_3 >= last_1_var_1_27 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L82] COND FALSE !(\read(var_1_7)) [L85] var_1_33 = var_1_28 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L89] var_1_19 = var_1_20 [L90] var_1_21 = ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24))))) [L91] var_1_27 = ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28) [L92] var_1_38 = var_1_20 [L93] var_1_39 = 128 [L94] unsigned char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=8, var_1_27=175, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L95] COND FALSE !(var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) [L100] var_1_25 = 2u VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=256, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L102] COND FALSE !(\read(var_1_7)) [L109] var_1_16 = var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L111] signed long int stepLocal_5 = var_1_30 + var_1_39; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, stepLocal_5=128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L112] COND TRUE (var_1_25 - last_1_var_1_35) <= stepLocal_5 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L113] COND FALSE !(\read(var_1_7)) [L116] var_1_35 = ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=65, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L119] unsigned short int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_1=32, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=65, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L120] COND TRUE stepLocal_1 <= var_1_35 [L121] var_1_18 = (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=65, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L125] EXPR var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=65, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L125] COND FALSE !((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) [L130] var_1_29 = (var_1_28 - var_1_30) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=62, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=65, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L132] COND TRUE var_1_21 > var_1_29 [L133] var_1_6 = (var_1_21 - last_1_var_1_6) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=62, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=65, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=64, var_1_7=0, var_1_8=1, var_1_9=-128] [L213] RET step() [L214] CALL, EXPR property() [L204] EXPR last_1_var_1_16 | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=62, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=65, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=64, var_1_7=0, var_1_8=1, var_1_9=-128] [L204] EXPR (((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30)))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=62, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=65, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=64, var_1_7=0, var_1_8=1, var_1_9=-128] [L204-L205] return (((((((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30))))) && ((last_1_var_1_16 <= last_1_var_1_9) ? (var_1_33 == ((unsigned char) (var_1_34 - var_1_28))) : (((var_1_24 % var_1_34) >= last_1_var_1_27) ? (var_1_7 ? (var_1_33 == ((unsigned char) (((((((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) > ((64 - var_1_30))) ? (((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) : ((64 - var_1_30)))) + 1))) : (var_1_33 == ((unsigned char) var_1_28))) : 1))) && (((var_1_25 - last_1_var_1_35) <= (var_1_30 + var_1_39)) ? (var_1_7 ? (var_1_35 == ((unsigned char) var_1_28)) : (var_1_35 == ((unsigned char) ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24))))))) : 1)) && (var_1_38 == ((double) var_1_20))) && (var_1_39 == ((signed short int) 128)) ; [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=62, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=65, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=64, var_1_7=0, var_1_8=1, var_1_9=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=62, var_1_15=5, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=63, var_1_22=126, var_1_23=0, var_1_24=63, var_1_25=2, var_1_27=175, var_1_28=318, var_1_29=62, var_1_30=0, var_1_31=0, var_1_33=318, var_1_34=127, var_1_35=65, var_1_36=190, var_1_37=-193, var_1_38=2, var_1_39=128, var_1_6=64, var_1_7=0, var_1_8=1, var_1_9=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 10, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1879 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1870 mSDsluCounter, 6375 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5037 mSDsCounter, 821 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4304 IncrementalHoareTripleChecker+Invalid, 5125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 821 mSolverCounterUnsat, 1338 mSDtfsCounter, 4304 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1262 GetRequests, 1078 SyntacticMatches, 2 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3718 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2495occurred in iteration=9, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1379 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 2602 NumberOfCodeBlocks, 2602 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2187 ConstructedInterpolants, 1 QuantifiedInterpolants, 17652 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1000 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 20244/20460 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-10-13 03:56:10,690 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.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 ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:56:12,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:56:13,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:56:13,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:56:13,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:56:13,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:56:13,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:56:13,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:56:13,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:56:13,079 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:56:13,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:56:13,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:56:13,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:56:13,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:56:13,083 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:56:13,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:56:13,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:56:13,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:56:13,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:56:13,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:56:13,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:56:13,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:56:13,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:56:13,086 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:56:13,086 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:56:13,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:56:13,087 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:56:13,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:56:13,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:56:13,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:56:13,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:56:13,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:56:13,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:56:13,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:56:13,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:56:13,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:56:13,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:56:13,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:56:13,091 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:56:13,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:56:13,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:56:13,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:56:13,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:56:13,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:56:13,092 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:56:13,093 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 -> ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac [2024-10-13 03:56:13,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:56:13,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:56:13,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:56:13,484 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:56:13,485 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:56:13,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-10-13 03:56:15,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:56:15,279 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:56:15,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-10-13 03:56:15,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28be05739/ac59d8e9d552406f9f2c1034c76e9388/FLAG60e8149e2 [2024-10-13 03:56:15,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28be05739/ac59d8e9d552406f9f2c1034c76e9388 [2024-10-13 03:56:15,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:56:15,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:56:15,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:56:15,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:56:15,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:56:15,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:15,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35da5453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15, skipping insertion in model container [2024-10-13 03:56:15,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:15,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:56:15,597 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-10-13 03:56:15,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:56:15,744 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:56:15,759 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-10-13 03:56:15,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:56:15,847 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:56:15,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15 WrapperNode [2024-10-13 03:56:15,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:56:15,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:56:15,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:56:15,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:56:15,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:15,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:15,918 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-13 03:56:15,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:56:15,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:56:15,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:56:15,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:56:15,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:15,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:15,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:15,970 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-10-13 03:56:15,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:15,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:15,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:15,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:16,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:16,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:16,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:56:16,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:56:16,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:56:16,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:56:16,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (1/1) ... [2024-10-13 03:56:16,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:56:16,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:56:16,054 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-10-13 03:56:16,058 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-10-13 03:56:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:56:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:56:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:56:16,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:56:16,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:56:16,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:56:16,237 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:56:16,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:56:17,788 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 03:56:17,792 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:56:17,875 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:56:17,875 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:56:17,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:56:17 BoogieIcfgContainer [2024-10-13 03:56:17,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:56:17,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:56:17,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:56:17,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:56:17,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:56:15" (1/3) ... [2024-10-13 03:56:17,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741fa11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:56:17, skipping insertion in model container [2024-10-13 03:56:17,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:56:15" (2/3) ... [2024-10-13 03:56:17,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741fa11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:56:17, skipping insertion in model container [2024-10-13 03:56:17,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:56:17" (3/3) ... [2024-10-13 03:56:17,885 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-22.i [2024-10-13 03:56:17,902 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:56:17,903 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:56:17,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:56:17,994 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;@68b28ad9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:56:17,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:56:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-13 03:56:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 03:56:18,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:18,022 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:18,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1031330066, now seen corresponding path program 1 times [2024-10-13 03:56:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:56:18,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540013623] [2024-10-13 03:56:18,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:18,043 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-10-13 03:56:18,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:56:18,047 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-10-13 03:56:18,048 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-10-13 03:56:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:18,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:56:18,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:56:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 924 proven. 0 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2024-10-13 03:56:18,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:56:18,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:56:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540013623] [2024-10-13 03:56:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540013623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:18,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:18,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:56:18,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654021543] [2024-10-13 03:56:18,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:18,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:56:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:56:18,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:56:18,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:56:18,535 INFO L87 Difference]: Start difference. First operand has 81 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 03:56:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:19,136 INFO L93 Difference]: Finished difference Result 159 states and 291 transitions. [2024-10-13 03:56:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:56:19,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 189 [2024-10-13 03:56:19,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:19,160 INFO L225 Difference]: With dead ends: 159 [2024-10-13 03:56:19,160 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 03:56:19,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 188 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-10-13 03:56:19,170 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:19,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:56:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 03:56:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 03:56:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-13 03:56:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 126 transitions. [2024-10-13 03:56:19,223 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 126 transitions. Word has length 189 [2024-10-13 03:56:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:19,223 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 126 transitions. [2024-10-13 03:56:19,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 03:56:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 126 transitions. [2024-10-13 03:56:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 03:56:19,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:19,228 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:19,237 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-10-13 03:56:19,428 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-10-13 03:56:19,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:19,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:19,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2131246508, now seen corresponding path program 1 times [2024-10-13 03:56:19,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:56:19,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515664590] [2024-10-13 03:56:19,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:19,432 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-10-13 03:56:19,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:56:19,435 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-10-13 03:56:19,436 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-10-13 03:56:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:19,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 03:56:19,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:56:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:56:21,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:56:21,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:56:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515664590] [2024-10-13 03:56:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515664590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:21,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:21,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:56:21,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434458004] [2024-10-13 03:56:21,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:21,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:56:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:56:21,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:56:21,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:56:21,242 INFO L87 Difference]: Start difference. First operand 79 states and 126 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:22,972 INFO L93 Difference]: Finished difference Result 259 states and 414 transitions. [2024-10-13 03:56:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:56:22,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 189 [2024-10-13 03:56:22,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:22,994 INFO L225 Difference]: With dead ends: 259 [2024-10-13 03:56:22,995 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 03:56:22,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:56:22,997 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 129 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:22,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 421 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 03:56:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 03:56:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 154. [2024-10-13 03:56:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 89 states have internal predecessors, (123), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 03:56:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 247 transitions. [2024-10-13 03:56:23,048 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 247 transitions. Word has length 189 [2024-10-13 03:56:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:23,050 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 247 transitions. [2024-10-13 03:56:23,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 247 transitions. [2024-10-13 03:56:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 03:56:23,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:23,063 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:23,085 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-10-13 03:56:23,264 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-10-13 03:56:23,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:23,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1142652434, now seen corresponding path program 1 times [2024-10-13 03:56:23,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:56:23,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594701984] [2024-10-13 03:56:23,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:23,267 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-10-13 03:56:23,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:56:23,270 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-10-13 03:56:23,271 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-10-13 03:56:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:23,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:56:23,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:56:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:56:24,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:56:24,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:56:24,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594701984] [2024-10-13 03:56:24,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594701984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:24,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:24,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:56:24,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648227898] [2024-10-13 03:56:24,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:24,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:56:24,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:56:24,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:56:24,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:56:24,673 INFO L87 Difference]: Start difference. First operand 154 states and 247 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:26,421 INFO L93 Difference]: Finished difference Result 311 states and 497 transitions. [2024-10-13 03:56:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:56:26,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 189 [2024-10-13 03:56:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:26,436 INFO L225 Difference]: With dead ends: 311 [2024-10-13 03:56:26,436 INFO L226 Difference]: Without dead ends: 158 [2024-10-13 03:56:26,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:56:26,439 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 71 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:26,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 352 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 03:56:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-13 03:56:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2024-10-13 03:56:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 03:56:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 210 transitions. [2024-10-13 03:56:26,476 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 210 transitions. Word has length 189 [2024-10-13 03:56:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:26,477 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 210 transitions. [2024-10-13 03:56:26,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 210 transitions. [2024-10-13 03:56:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 03:56:26,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:26,480 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:26,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 03:56:26,680 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-10-13 03:56:26,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:26,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash 14767381, now seen corresponding path program 1 times [2024-10-13 03:56:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:56:26,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622509903] [2024-10-13 03:56:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:26,683 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-10-13 03:56:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:56:26,686 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-10-13 03:56:26,690 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-10-13 03:56:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:26,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:56:26,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:56:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:56:27,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:56:27,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:56:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622509903] [2024-10-13 03:56:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622509903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:27,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:27,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:56:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731957402] [2024-10-13 03:56:27,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:27,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:56:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:56:27,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:56:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:56:27,302 INFO L87 Difference]: Start difference. First operand 133 states and 210 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:28,610 INFO L93 Difference]: Finished difference Result 236 states and 375 transitions. [2024-10-13 03:56:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:56:28,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 190 [2024-10-13 03:56:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:28,627 INFO L225 Difference]: With dead ends: 236 [2024-10-13 03:56:28,627 INFO L226 Difference]: Without dead ends: 158 [2024-10-13 03:56:28,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:56:28,629 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 59 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:28,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 476 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 03:56:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-13 03:56:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2024-10-13 03:56:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 03:56:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 214 transitions. [2024-10-13 03:56:28,662 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 214 transitions. Word has length 190 [2024-10-13 03:56:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:28,663 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 214 transitions. [2024-10-13 03:56:28,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 214 transitions. [2024-10-13 03:56:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 03:56:28,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:28,670 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:28,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 03:56:28,870 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-10-13 03:56:28,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:28,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash -463373863, now seen corresponding path program 1 times [2024-10-13 03:56:28,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:56:28,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250354586] [2024-10-13 03:56:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:28,872 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-10-13 03:56:28,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:56:28,874 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-10-13 03:56:28,875 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-10-13 03:56:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:29,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:56:29,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:56:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:56:29,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:56:29,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:56:29,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250354586] [2024-10-13 03:56:29,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250354586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:56:29,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:56:29,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:56:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016326062] [2024-10-13 03:56:29,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:29,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:56:29,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:56:29,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:56:29,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:56:29,360 INFO L87 Difference]: Start difference. First operand 136 states and 214 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:30,559 INFO L93 Difference]: Finished difference Result 321 states and 507 transitions. [2024-10-13 03:56:30,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:56:30,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2024-10-13 03:56:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:30,575 INFO L225 Difference]: With dead ends: 321 [2024-10-13 03:56:30,575 INFO L226 Difference]: Without dead ends: 243 [2024-10-13 03:56:30,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 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-10-13 03:56:30,577 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 140 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:30,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 417 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 03:56:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-13 03:56:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2024-10-13 03:56:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 118 states have internal predecessors, (156), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-13 03:56:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 342 transitions. [2024-10-13 03:56:30,616 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 342 transitions. Word has length 191 [2024-10-13 03:56:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:30,616 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 342 transitions. [2024-10-13 03:56:30,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 342 transitions. [2024-10-13 03:56:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 03:56:30,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:30,619 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:30,630 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-10-13 03:56:30,819 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-10-13 03:56:30,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:30,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1194468943, now seen corresponding path program 1 times [2024-10-13 03:56:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:56:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889410853] [2024-10-13 03:56:30,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:30,821 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-10-13 03:56:30,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:56:30,822 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-10-13 03:56:30,823 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-10-13 03:56:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:31,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 03:56:31,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:56:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 148 proven. 87 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2024-10-13 03:56:31,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:56:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:56:31,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:56:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889410853] [2024-10-13 03:56:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889410853] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 03:56:31,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 03:56:31,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-13 03:56:31,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731773734] [2024-10-13 03:56:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:56:31,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:56:31,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:56:31,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:56:31,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:56:31,593 INFO L87 Difference]: Start difference. First operand 215 states and 342 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:56:33,191 INFO L93 Difference]: Finished difference Result 421 states and 673 transitions. [2024-10-13 03:56:33,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:56:33,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2024-10-13 03:56:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:56:33,209 INFO L225 Difference]: With dead ends: 421 [2024-10-13 03:56:33,209 INFO L226 Difference]: Without dead ends: 264 [2024-10-13 03:56:33,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:56:33,211 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 40 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:56:33,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 360 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 03:56:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-13 03:56:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 231. [2024-10-13 03:56:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 134 states have (on average 1.328358208955224) internal successors, (178), 134 states have internal predecessors, (178), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-13 03:56:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 364 transitions. [2024-10-13 03:56:33,256 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 364 transitions. Word has length 192 [2024-10-13 03:56:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:56:33,257 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 364 transitions. [2024-10-13 03:56:33,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 03:56:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 364 transitions. [2024-10-13 03:56:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 03:56:33,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:56:33,259 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:56:33,271 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 (7)] Ended with exit code 0 [2024-10-13 03:56:33,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10-13 03:56:33,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:56:33,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:56:33,462 INFO L85 PathProgramCache]: Analyzing trace with hash -493404365, now seen corresponding path program 1 times [2024-10-13 03:56:33,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:56:33,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400984408] [2024-10-13 03:56:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:33,462 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-10-13 03:56:33,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:56:33,464 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:56:33,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 03:56:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:56:33,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 03:56:33,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:56:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 839 proven. 48 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2024-10-13 03:56:35,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:56:35,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:56:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400984408] [2024-10-13 03:56:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400984408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:56:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1752495657] [2024-10-13 03:56:35,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:56:35,609 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:56:35,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:56:35,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:56:35,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process