./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_fillercode_fillercodestructure_filler-ps-ci_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:59:08,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:59:09,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:59:09,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:59:09,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:59:09,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:59:09,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:59:09,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:59:09,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:59:09,090 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:59:09,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:59:09,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:59:09,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:59:09,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:59:09,095 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:59:09,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:59:09,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:59:09,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:59:09,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:59:09,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:59:09,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:59:09,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:59:09,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:59:09,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:59:09,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:59:09,101 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:59:09,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:59:09,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:59:09,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:59:09,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:59:09,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:59:09,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:59:09,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:59:09,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:59:09,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:59:09,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:59:09,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:59:09,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:59:09,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:59:09,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:59:09,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:59:09,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:59:09,107 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-clean/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-clean/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 -> 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 [2024-10-11 09:59:09,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:59:09,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:59:09,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:59:09,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:59:09,415 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:59:09,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-11 09:59:10,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:59:11,120 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:59:11,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-11 09:59:11,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f14a5c74/41abcade43974b58b817c27c75cfe104/FLAG935273709 [2024-10-11 09:59:11,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f14a5c74/41abcade43974b58b817c27c75cfe104 [2024-10-11 09:59:11,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:59:11,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:59:11,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:59:11,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:59:11,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:59:11,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419458f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11, skipping insertion in model container [2024-10-11 09:59:11,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:59:11,376 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_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-10-11 09:59:11,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:59:11,460 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:59:11,473 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_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-10-11 09:59:11,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:59:11,529 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:59:11,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11 WrapperNode [2024-10-11 09:59:11,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:59:11,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:59:11,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:59:11,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:59:11,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,600 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 287 [2024-10-11 09:59:11,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:59:11,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:59:11,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:59:11,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:59:11,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,656 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-11 09:59:11,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:59:11,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:59:11,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:59:11,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:59:11,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (1/1) ... [2024-10-11 09:59:11,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:59:11,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:59:11,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:59:11,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:59:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:59:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:59:11,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:59:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:59:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:59:11,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:59:11,901 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:59:11,903 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:59:12,393 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 09:59:12,394 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:59:12,430 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:59:12,430 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:59:12,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:59:12 BoogieIcfgContainer [2024-10-11 09:59:12,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:59:12,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:59:12,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:59:12,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:59:12,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:59:11" (1/3) ... [2024-10-11 09:59:12,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d37b4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:59:12, skipping insertion in model container [2024-10-11 09:59:12,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:11" (2/3) ... [2024-10-11 09:59:12,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d37b4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:59:12, skipping insertion in model container [2024-10-11 09:59:12,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:59:12" (3/3) ... [2024-10-11 09:59:12,439 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-11 09:59:12,459 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:59:12,460 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:59:12,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:59:12,535 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;@5fc67a87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:59:12,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:59:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 80 states have (on average 1.525) internal successors, (122), 81 states have internal predecessors, (122), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 09:59:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 09:59:12,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:12,565 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:12,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:12,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:12,571 INFO L85 PathProgramCache]: Analyzing trace with hash 260404430, now seen corresponding path program 1 times [2024-10-11 09:59:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:12,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160279143] [2024-10-11 09:59:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 09:59:13,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:13,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160279143] [2024-10-11 09:59:13,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160279143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:59:13,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:59:13,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:59:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433300714] [2024-10-11 09:59:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:13,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:59:13,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:13,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:59:13,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:59:13,885 INFO L87 Difference]: Start difference. First operand has 116 states, 80 states have (on average 1.525) internal successors, (122), 81 states have internal predecessors, (122), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:14,262 INFO L93 Difference]: Finished difference Result 369 states and 672 transitions. [2024-10-11 09:59:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:59:14,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-10-11 09:59:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:14,283 INFO L225 Difference]: With dead ends: 369 [2024-10-11 09:59:14,286 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 09:59:14,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-11 09:59:14,297 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 237 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:14,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 471 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:59:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 09:59:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 223. [2024-10-11 09:59:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 154 states have (on average 1.474025974025974) internal successors, (227), 154 states have internal predecessors, (227), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 09:59:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 359 transitions. [2024-10-11 09:59:14,406 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 359 transitions. Word has length 209 [2024-10-11 09:59:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:14,409 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 359 transitions. [2024-10-11 09:59:14,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 359 transitions. [2024-10-11 09:59:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 09:59:14,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:14,415 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:14,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:59:14,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:14,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash 61310808, now seen corresponding path program 1 times [2024-10-11 09:59:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:14,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102492101] [2024-10-11 09:59:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 09:59:14,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:14,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102492101] [2024-10-11 09:59:14,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102492101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:59:14,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:59:14,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:59:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543300873] [2024-10-11 09:59:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:14,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:59:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:14,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:59:14,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:59:14,776 INFO L87 Difference]: Start difference. First operand 223 states and 359 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:14,958 INFO L93 Difference]: Finished difference Result 665 states and 1071 transitions. [2024-10-11 09:59:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:59:14,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-11 09:59:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:14,967 INFO L225 Difference]: With dead ends: 665 [2024-10-11 09:59:14,968 INFO L226 Difference]: Without dead ends: 443 [2024-10-11 09:59:14,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-11 09:59:14,976 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 161 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:14,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 395 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:59:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-11 09:59:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2024-10-11 09:59:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 304 states have (on average 1.4671052631578947) internal successors, (446), 304 states have internal predecessors, (446), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-10-11 09:59:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 710 transitions. [2024-10-11 09:59:15,077 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 710 transitions. Word has length 210 [2024-10-11 09:59:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:15,079 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 710 transitions. [2024-10-11 09:59:15,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 710 transitions. [2024-10-11 09:59:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 09:59:15,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:15,084 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:59:15,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1170839464, now seen corresponding path program 1 times [2024-10-11 09:59:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905683585] [2024-10-11 09:59:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 09:59:15,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:15,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905683585] [2024-10-11 09:59:15,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905683585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:59:15,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:59:15,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:59:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943049432] [2024-10-11 09:59:15,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:15,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:59:15,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:15,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:59:15,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:59:15,509 INFO L87 Difference]: Start difference. First operand 441 states and 710 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:16,277 INFO L93 Difference]: Finished difference Result 1662 states and 2653 transitions. [2024-10-11 09:59:16,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:59:16,278 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-11 09:59:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:16,290 INFO L225 Difference]: With dead ends: 1662 [2024-10-11 09:59:16,291 INFO L226 Difference]: Without dead ends: 1222 [2024-10-11 09:59:16,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:59:16,295 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 418 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:16,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 561 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 09:59:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-10-11 09:59:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1208. [2024-10-11 09:59:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 907 states have (on average 1.496141124586549) internal successors, (1357), 915 states have internal predecessors, (1357), 286 states have call successors, (286), 14 states have call predecessors, (286), 14 states have return successors, (286), 278 states have call predecessors, (286), 286 states have call successors, (286) [2024-10-11 09:59:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1929 transitions. [2024-10-11 09:59:16,462 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1929 transitions. Word has length 210 [2024-10-11 09:59:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:16,463 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1929 transitions. [2024-10-11 09:59:16,464 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1929 transitions. [2024-10-11 09:59:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 09:59:16,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:16,470 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:16,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:59:16,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:16,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash 648116822, now seen corresponding path program 1 times [2024-10-11 09:59:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:16,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78020308] [2024-10-11 09:59:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:16,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:16,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:16,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 09:59:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:17,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78020308] [2024-10-11 09:59:17,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78020308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:59:17,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:59:17,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:59:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442025789] [2024-10-11 09:59:17,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:17,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:59:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:17,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:59:17,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:59:17,087 INFO L87 Difference]: Start difference. First operand 1208 states and 1929 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:17,865 INFO L93 Difference]: Finished difference Result 1756 states and 2789 transitions. [2024-10-11 09:59:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:59:17,866 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-11 09:59:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:17,877 INFO L225 Difference]: With dead ends: 1756 [2024-10-11 09:59:17,877 INFO L226 Difference]: Without dead ends: 1535 [2024-10-11 09:59:17,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 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-11 09:59:17,880 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 317 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:17,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 688 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 09:59:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-10-11 09:59:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1516. [2024-10-11 09:59:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1164 states have (on average 1.5051546391752577) internal successors, (1752), 1177 states have internal predecessors, (1752), 332 states have call successors, (332), 19 states have call predecessors, (332), 19 states have return successors, (332), 319 states have call predecessors, (332), 332 states have call successors, (332) [2024-10-11 09:59:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2416 transitions. [2024-10-11 09:59:18,047 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2416 transitions. Word has length 210 [2024-10-11 09:59:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:18,048 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 2416 transitions. [2024-10-11 09:59:18,048 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2416 transitions. [2024-10-11 09:59:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 09:59:18,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:18,052 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:18,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:59:18,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:18,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:18,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1030290854, now seen corresponding path program 1 times [2024-10-11 09:59:18,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:18,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337783056] [2024-10-11 09:59:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 09:59:18,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337783056] [2024-10-11 09:59:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337783056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:59:18,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:59:18,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:59:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796242877] [2024-10-11 09:59:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:18,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:59:18,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:59:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:59:18,506 INFO L87 Difference]: Start difference. First operand 1516 states and 2416 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:18,659 INFO L93 Difference]: Finished difference Result 2537 states and 4043 transitions. [2024-10-11 09:59:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:59:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-11 09:59:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:18,670 INFO L225 Difference]: With dead ends: 2537 [2024-10-11 09:59:18,670 INFO L226 Difference]: Without dead ends: 1022 [2024-10-11 09:59:18,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-11 09:59:18,676 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 118 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:18,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 306 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:59:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-10-11 09:59:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1020. [2024-10-11 09:59:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 784 states have (on average 1.4808673469387754) internal successors, (1161), 793 states have internal predecessors, (1161), 222 states have call successors, (222), 13 states have call predecessors, (222), 13 states have return successors, (222), 213 states have call predecessors, (222), 222 states have call successors, (222) [2024-10-11 09:59:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1605 transitions. [2024-10-11 09:59:18,768 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1605 transitions. Word has length 210 [2024-10-11 09:59:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:18,769 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1605 transitions. [2024-10-11 09:59:18,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1605 transitions. [2024-10-11 09:59:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-11 09:59:18,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:18,772 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:18,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:59:18,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:18,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1727259607, now seen corresponding path program 1 times [2024-10-11 09:59:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:18,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666017406] [2024-10-11 09:59:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 09:59:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:19,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666017406] [2024-10-11 09:59:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666017406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:59:19,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:59:19,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:59:19,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372060857] [2024-10-11 09:59:19,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:19,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:59:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:19,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:59:19,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:59:19,120 INFO L87 Difference]: Start difference. First operand 1020 states and 1605 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:19,312 INFO L93 Difference]: Finished difference Result 1757 states and 2775 transitions. [2024-10-11 09:59:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:59:19,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2024-10-11 09:59:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:19,318 INFO L225 Difference]: With dead ends: 1757 [2024-10-11 09:59:19,319 INFO L226 Difference]: Without dead ends: 738 [2024-10-11 09:59:19,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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-11 09:59:19,325 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 139 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:19,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 516 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:59:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-10-11 09:59:19,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 655. [2024-10-11 09:59:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 501 states have (on average 1.4890219560878244) internal successors, (746), 506 states have internal predecessors, (746), 145 states have call successors, (145), 8 states have call predecessors, (145), 8 states have return successors, (145), 140 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-11 09:59:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1036 transitions. [2024-10-11 09:59:19,381 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1036 transitions. Word has length 212 [2024-10-11 09:59:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:19,382 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1036 transitions. [2024-10-11 09:59:19,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1036 transitions. [2024-10-11 09:59:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-11 09:59:19,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:19,386 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:19,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:59:19,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:19,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:19,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1980901675, now seen corresponding path program 1 times [2024-10-11 09:59:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:19,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787476252] [2024-10-11 09:59:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:19,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 09:59:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787476252] [2024-10-11 09:59:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787476252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:59:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:59:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 09:59:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417444960] [2024-10-11 09:59:20,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:20,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 09:59:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 09:59:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:59:20,420 INFO L87 Difference]: Start difference. First operand 655 states and 1036 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 09:59:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:21,689 INFO L93 Difference]: Finished difference Result 1374 states and 2165 transitions. [2024-10-11 09:59:21,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:59:21,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212 [2024-10-11 09:59:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:21,696 INFO L225 Difference]: With dead ends: 1374 [2024-10-11 09:59:21,697 INFO L226 Difference]: Without dead ends: 827 [2024-10-11 09:59:21,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 09:59:21,700 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 332 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:21,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 676 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 09:59:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-10-11 09:59:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 803. [2024-10-11 09:59:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 625 states have (on average 1.4816) internal successors, (926), 632 states have internal predecessors, (926), 165 states have call successors, (165), 12 states have call predecessors, (165), 12 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-11 09:59:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1256 transitions. [2024-10-11 09:59:21,761 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1256 transitions. Word has length 212 [2024-10-11 09:59:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:21,762 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1256 transitions. [2024-10-11 09:59:21,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 09:59:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1256 transitions. [2024-10-11 09:59:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 09:59:21,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:21,765 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:21,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:59:21,766 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:21,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:21,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1872857671, now seen corresponding path program 1 times [2024-10-11 09:59:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:21,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791739787] [2024-10-11 09:59:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:21,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 09:59:21,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:21,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791739787] [2024-10-11 09:59:21,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791739787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:59:21,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:59:21,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:59:21,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102846114] [2024-10-11 09:59:21,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:21,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:59:21,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:21,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:59:21,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:59:21,938 INFO L87 Difference]: Start difference. First operand 803 states and 1256 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:22,056 INFO L93 Difference]: Finished difference Result 2027 states and 3175 transitions. [2024-10-11 09:59:22,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:59:22,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-10-11 09:59:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:22,066 INFO L225 Difference]: With dead ends: 2027 [2024-10-11 09:59:22,066 INFO L226 Difference]: Without dead ends: 1408 [2024-10-11 09:59:22,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-11 09:59:22,070 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 170 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:22,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 339 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:59:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-10-11 09:59:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 902. [2024-10-11 09:59:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 724 states have (on average 1.4986187845303867) internal successors, (1085), 731 states have internal predecessors, (1085), 165 states have call successors, (165), 12 states have call predecessors, (165), 12 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-11 09:59:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1415 transitions. [2024-10-11 09:59:22,180 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1415 transitions. Word has length 213 [2024-10-11 09:59:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:22,181 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1415 transitions. [2024-10-11 09:59:22,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1415 transitions. [2024-10-11 09:59:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 09:59:22,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:22,184 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:22,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 09:59:22,184 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:22,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:22,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1192799301, now seen corresponding path program 1 times [2024-10-11 09:59:22,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:22,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916921182] [2024-10-11 09:59:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:22,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 09:59:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916921182] [2024-10-11 09:59:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916921182] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:59:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266311100] [2024-10-11 09:59:22,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:22,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:59:22,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:59:22,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:59:22,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:59:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:22,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:59:22,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:59:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 848 proven. 24 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2024-10-11 09:59:22,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:59:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 09:59:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266311100] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:59:23,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:59:23,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 09:59:23,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067784811] [2024-10-11 09:59:23,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:59:23,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:59:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:23,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:59:23,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:59:23,095 INFO L87 Difference]: Start difference. First operand 902 states and 1415 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-11 09:59:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:23,409 INFO L93 Difference]: Finished difference Result 1685 states and 2627 transitions. [2024-10-11 09:59:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:59:23,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 213 [2024-10-11 09:59:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:23,415 INFO L225 Difference]: With dead ends: 1685 [2024-10-11 09:59:23,416 INFO L226 Difference]: Without dead ends: 920 [2024-10-11 09:59:23,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 487 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:59:23,419 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 215 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:23,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 346 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:59:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-11 09:59:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 914. [2024-10-11 09:59:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 733 states have (on average 1.4624829467939973) internal successors, (1072), 740 states have internal predecessors, (1072), 165 states have call successors, (165), 15 states have call predecessors, (165), 15 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-11 09:59:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1402 transitions. [2024-10-11 09:59:23,522 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1402 transitions. Word has length 213 [2024-10-11 09:59:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:23,523 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1402 transitions. [2024-10-11 09:59:23,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-11 09:59:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1402 transitions. [2024-10-11 09:59:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 09:59:23,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:23,526 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:23,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:59:23,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:59:23,731 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:23,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:23,731 INFO L85 PathProgramCache]: Analyzing trace with hash -496144441, now seen corresponding path program 1 times [2024-10-11 09:59:23,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:23,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259286269] [2024-10-11 09:59:23,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:23,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 09:59:24,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259286269] [2024-10-11 09:59:24,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259286269] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:59:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895341873] [2024-10-11 09:59:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:59:24,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:59:24,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:59:24,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:59:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:24,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 09:59:24,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:59:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-10-11 09:59:25,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:59:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 09:59:26,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895341873] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:59:26,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:59:26,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 23 [2024-10-11 09:59:26,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355071241] [2024-10-11 09:59:26,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:59:26,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 09:59:26,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:26,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 09:59:26,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2024-10-11 09:59:26,421 INFO L87 Difference]: Start difference. First operand 914 states and 1402 transitions. Second operand has 23 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 23 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 7 states have call successors, (99) [2024-10-11 09:59:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:30,658 INFO L93 Difference]: Finished difference Result 3393 states and 5243 transitions. [2024-10-11 09:59:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-11 09:59:30,659 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 23 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 7 states have call successors, (99) Word has length 213 [2024-10-11 09:59:30,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:30,674 INFO L225 Difference]: With dead ends: 3393 [2024-10-11 09:59:30,675 INFO L226 Difference]: Without dead ends: 2589 [2024-10-11 09:59:30,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=643, Invalid=2437, Unknown=0, NotChecked=0, Total=3080 [2024-10-11 09:59:30,681 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1708 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 3032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:30,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 1487 Invalid, 3032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 09:59:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2024-10-11 09:59:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 1166. [2024-10-11 09:59:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 931 states have (on average 1.4736842105263157) internal successors, (1372), 940 states have internal predecessors, (1372), 214 states have call successors, (214), 20 states have call predecessors, (214), 20 states have return successors, (214), 205 states have call predecessors, (214), 214 states have call successors, (214) [2024-10-11 09:59:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1800 transitions. [2024-10-11 09:59:30,898 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1800 transitions. Word has length 213 [2024-10-11 09:59:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:30,898 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1800 transitions. [2024-10-11 09:59:30,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 23 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 7 states have call successors, (99) [2024-10-11 09:59:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1800 transitions. [2024-10-11 09:59:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 09:59:30,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:30,902 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:30,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:59:31,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:59:31,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:31,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1017129163, now seen corresponding path program 1 times [2024-10-11 09:59:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:31,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096495799] [2024-10-11 09:59:31,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:31,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:59:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:59:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:59:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:59:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:59:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:59:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:59:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:59:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:59:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:59:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:59:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:59:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:59:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:59:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:59:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:59:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:59:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:59:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:59:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:59:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:59:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:59:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:59:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:59:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:59:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:59:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:59:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:59:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:59:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:59:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:59:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:59:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:59:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 09:59:31,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:59:31,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096495799] [2024-10-11 09:59:31,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096495799] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:59:31,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581026190] [2024-10-11 09:59:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:31,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:59:31,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:59:31,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:59:31,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:59:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:31,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:59:31,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:59:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-10-11 09:59:32,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:59:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 09:59:32,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581026190] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:59:32,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:59:32,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-11 09:59:32,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595495811] [2024-10-11 09:59:32,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:59:32,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:59:32,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:59:32,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:59:32,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:59:32,271 INFO L87 Difference]: Start difference. First operand 1166 states and 1800 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-11 09:59:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:32,905 INFO L93 Difference]: Finished difference Result 2097 states and 3223 transitions. [2024-10-11 09:59:32,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 09:59:32,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 216 [2024-10-11 09:59:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:32,914 INFO L225 Difference]: With dead ends: 2097 [2024-10-11 09:59:32,914 INFO L226 Difference]: Without dead ends: 1069 [2024-10-11 09:59:32,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 493 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-11 09:59:32,918 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 213 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:32,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 621 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:59:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-10-11 09:59:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1050. [2024-10-11 09:59:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 811 states have (on average 1.409371146732429) internal successors, (1143), 820 states have internal predecessors, (1143), 214 states have call successors, (214), 24 states have call predecessors, (214), 24 states have return successors, (214), 205 states have call predecessors, (214), 214 states have call successors, (214) [2024-10-11 09:59:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1571 transitions. [2024-10-11 09:59:33,082 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1571 transitions. Word has length 216 [2024-10-11 09:59:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:33,083 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1571 transitions. [2024-10-11 09:59:33,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-11 09:59:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1571 transitions. [2024-10-11 09:59:33,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 09:59:33,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:33,086 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:33,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 09:59:33,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:59:33,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:33,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash 624102153, now seen corresponding path program 1 times [2024-10-11 09:59:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:59:33,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052460430] [2024-10-11 09:59:33,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:33,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:59:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:59:33,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078341584] [2024-10-11 09:59:33,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:33,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:59:33,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:59:33,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:59:33,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 09:59:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:59:33,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:59:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:59:33,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:59:33,981 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:59:33,982 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:59:34,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 09:59:34,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 09:59:34,188 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:59:34,356 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:59:34,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:59:34 BoogieIcfgContainer [2024-10-11 09:59:34,359 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:59:34,360 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:59:34,360 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:59:34,361 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:59:34,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:59:12" (3/4) ... [2024-10-11 09:59:34,364 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:59:34,365 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:59:34,366 INFO L158 Benchmark]: Toolchain (without parser) took 23207.82ms. Allocated memory was 176.2MB in the beginning and 444.6MB in the end (delta: 268.4MB). Free memory was 131.4MB in the beginning and 284.8MB in the end (delta: -153.4MB). Peak memory consumption was 117.5MB. Max. memory is 16.1GB. [2024-10-11 09:59:34,366 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:59:34,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.49ms. Allocated memory is still 176.2MB. Free memory was 131.4MB in the beginning and 114.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 09:59:34,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.58ms. Allocated memory is still 176.2MB. Free memory was 114.0MB in the beginning and 110.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:59:34,367 INFO L158 Benchmark]: Boogie Preprocessor took 83.42ms. Allocated memory is still 176.2MB. Free memory was 110.4MB in the beginning and 107.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:59:34,367 INFO L158 Benchmark]: RCFGBuilder took 743.58ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 74.1MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 09:59:34,367 INFO L158 Benchmark]: TraceAbstraction took 21926.75ms. Allocated memory was 176.2MB in the beginning and 444.6MB in the end (delta: 268.4MB). Free memory was 73.4MB in the beginning and 284.8MB in the end (delta: -211.4MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2024-10-11 09:59:34,368 INFO L158 Benchmark]: Witness Printer took 5.53ms. Allocated memory is still 444.6MB. Free memory is still 284.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:59:34,369 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 176.2MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.49ms. Allocated memory is still 176.2MB. Free memory was 131.4MB in the beginning and 114.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.58ms. Allocated memory is still 176.2MB. Free memory was 114.0MB in the beginning and 110.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.42ms. Allocated memory is still 176.2MB. Free memory was 110.4MB in the beginning and 107.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 743.58ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 74.1MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21926.75ms. Allocated memory was 176.2MB in the beginning and 444.6MB in the end (delta: 268.4MB). Free memory was 73.4MB in the beginning and 284.8MB in the end (delta: -211.4MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Witness Printer took 5.53ms. Allocated memory is still 444.6MB. Free memory is still 284.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 202, overapproximation of bitwiseOr at line 66, overapproximation of someBinaryArithmeticDOUBLEoperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] double var_1_4 = 10.5; [L24] double var_1_5 = 1.55; [L25] signed char var_1_8 = -10; [L26] signed char var_1_10 = -16; [L27] signed char var_1_11 = -4; [L28] signed char var_1_12 = -16; [L29] double var_1_13 = 128.55; [L30] double var_1_14 = 2.3; [L31] double var_1_15 = 4.8; [L32] unsigned long int var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] signed long int var_1_18 = 256; [L35] unsigned long int var_1_19 = 50; [L36] unsigned long int var_1_20 = 1; [L37] signed short int var_1_21 = -50; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_28 = 0; [L42] unsigned char var_1_29 = 0; [L43] unsigned char var_1_30 = 1; [L44] unsigned long int var_1_31 = 200; [L45] unsigned char var_1_35 = 32; [L46] unsigned char var_1_36 = 10; [L47] double var_1_37 = 15.5; [L48] signed long int var_1_39 = -10; [L49] unsigned long int var_1_42 = 10000; [L50] unsigned long int var_1_43 = 4251471014; [L51] signed short int var_1_44 = 64; [L52] unsigned char var_1_45 = 1; [L53] unsigned long int var_1_46 = 25; [L54] signed long int var_1_47 = -50; [L55] unsigned char var_1_48 = 0; [L56] double var_1_49 = 16.5; [L57] signed char last_1_var_1_8 = -10; [L58] signed short int last_1_var_1_21 = -50; [L59] unsigned char last_1_var_1_23 = 1; [L206] isInitial = 1 [L207] FCALL initially() [L208] COND TRUE 1 [L209] CALL updateLastVariables() [L197] last_1_var_1_8 = var_1_8 [L198] last_1_var_1_21 = var_1_21 [L199] last_1_var_1_23 = var_1_23 [L209] RET updateLastVariables() [L210] CALL updateVariables() [L144] var_1_4 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L145] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L146] var_1_5 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L147] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L148] var_1_10 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L149] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L150] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L150] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L151] var_1_11 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L152] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L153] CALL assume_abort_if_not(var_1_11 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L153] RET assume_abort_if_not(var_1_11 <= 32) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L154] var_1_12 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L155] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L156] CALL assume_abort_if_not(var_1_12 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L156] RET assume_abort_if_not(var_1_12 <= 31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L157] var_1_14 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L158] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L159] var_1_15 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L160] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L161] var_1_17 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L162] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L163] CALL assume_abort_if_not(var_1_17 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L163] RET assume_abort_if_not(var_1_17 <= 1073741824) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L164] var_1_18 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L165] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L166] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L166] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L167] var_1_19 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L168] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L169] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L169] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L170] var_1_20 = __VERIFIER_nondet_ulong() [L171] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L171] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L172] CALL assume_abort_if_not(var_1_20 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L172] RET assume_abort_if_not(var_1_20 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L173] var_1_24 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L174] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L175] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L175] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L176] var_1_28 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L177] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L178] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L178] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L179] var_1_29 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L180] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L181] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L181] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L182] var_1_30 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L183] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L184] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L184] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L185] var_1_36 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L186] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L187] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L187] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L188] var_1_43 = __VERIFIER_nondet_ulong() [L189] CALL assume_abort_if_not(var_1_43 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L189] RET assume_abort_if_not(var_1_43 >= 3221225470) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L190] CALL assume_abort_if_not(var_1_43 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L190] RET assume_abort_if_not(var_1_43 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L191] var_1_45 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L192] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L193] CALL assume_abort_if_not(var_1_45 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L193] RET assume_abort_if_not(var_1_45 <= 255) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L194] CALL assume_abort_if_not(var_1_45 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L194] RET assume_abort_if_not(var_1_45 != 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L210] RET updateVariables() [L211] CALL step() [L63] COND FALSE !(32 >= var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR 16u | var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR (((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR 16u | var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR (((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] COND FALSE !(var_1_19 > (((((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18)))) [L71] EXPR var_1_17 & -10 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L71] COND FALSE !((var_1_17 & -10) < var_1_19) [L80] var_1_37 = var_1_5 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L81] COND FALSE !(! var_1_30) [L84] var_1_39 = (var_1_16 + ((((var_1_36) > ((var_1_8 + var_1_12))) ? (var_1_36) : ((var_1_8 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L86] var_1_42 = ((var_1_43 - var_1_36) - var_1_21) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L87] COND TRUE (var_1_18 / var_1_45) > ((((var_1_36) < 0 ) ? -(var_1_36) : (var_1_36))) [L88] var_1_44 = ((((var_1_45) < ((((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) ? (var_1_45) : ((((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L92] var_1_46 = var_1_43 [L93] var_1_47 = var_1_8 [L94] var_1_48 = var_1_30 [L95] var_1_49 = var_1_15 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-10] [L96] COND TRUE last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-10] [L97] COND TRUE \read(last_1_var_1_23) [L98] var_1_8 = (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L103] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L104] COND FALSE !(128u >= var_1_8) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L111] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L115] COND TRUE var_1_8 >= ((1329162249 - var_1_17) - var_1_18) [L116] var_1_16 = (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L124] COND FALSE !(((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L133] unsigned char stepLocal_1 = var_1_23; [L134] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_0=-1, stepLocal_1=0, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L135] COND TRUE stepLocal_0 >= var_1_16 [L136] var_1_1 = (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_1=0, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L211] RET step() [L212] CALL, EXPR property() [L202] EXPR (((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L202-L203] return ((((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1)) && (var_1_23 == ((unsigned char) var_1_24)) ; [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.7s, OverallIterations: 12, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4141 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4028 mSDsluCounter, 6406 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4370 mSDsCounter, 1064 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5014 IncrementalHoareTripleChecker+Invalid, 6078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1064 mSolverCounterUnsat, 2036 mSDtfsCounter, 5014 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2130 GetRequests, 2014 SyntacticMatches, 6 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1516occurred in iteration=4, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 2129 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 3402 NumberOfCodeBlocks, 3402 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3595 ConstructedInterpolants, 0 QuantifiedInterpolants, 13429 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 35535/35904 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-11 09:59:34,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:59:36,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:59:36,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:59:36,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:59:36,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:59:37,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:59:37,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:59:37,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:59:37,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:59:37,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:59:37,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:59:37,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:59:37,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:59:37,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:59:37,007 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:59:37,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:59:37,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:59:37,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:59:37,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:59:37,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:59:37,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:59:37,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:59:37,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:59:37,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:59:37,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:59:37,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:59:37,012 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:59:37,012 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:59:37,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:59:37,013 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:59:37,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:59:37,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:59:37,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:59:37,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:59:37,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:59:37,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:59:37,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:59:37,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:59:37,016 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:59:37,016 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:59:37,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:59:37,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:59:37,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:59:37,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:59:37,018 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:59:37,018 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-clean/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-clean/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 -> 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 [2024-10-11 09:59:37,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:59:37,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:59:37,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:59:37,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:59:37,433 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:59:37,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-11 09:59:39,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:59:39,308 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:59:39,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-11 09:59:39,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2eee0b5ca/2014f62a202f4b048239c9ec2158787f/FLAGc96402632 [2024-10-11 09:59:39,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2eee0b5ca/2014f62a202f4b048239c9ec2158787f [2024-10-11 09:59:39,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:59:39,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:59:39,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:59:39,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:59:39,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:59:39,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fc2168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39, skipping insertion in model container [2024-10-11 09:59:39,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:59:39,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_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-10-11 09:59:39,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:59:39,717 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:59:39,730 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_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-10-11 09:59:39,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:59:39,810 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:59:39,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39 WrapperNode [2024-10-11 09:59:39,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:59:39,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:59:39,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:59:39,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:59:39,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,886 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-11 09:59:39,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:59:39,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:59:39,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:59:39,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:59:39,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,941 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-11 09:59:39,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:59:39,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:59:39,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:59:39,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:59:39,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (1/1) ... [2024-10-11 09:59:39,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:59:40,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:59:40,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:59:40,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:59:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:59:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:59:40,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:59:40,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:59:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:59:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:59:40,201 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:59:40,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:59:43,905 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 09:59:43,905 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:59:43,961 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:59:43,962 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:59:43,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:59:43 BoogieIcfgContainer [2024-10-11 09:59:43,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:59:43,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:59:43,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:59:43,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:59:43,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:59:39" (1/3) ... [2024-10-11 09:59:43,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181dcf7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:59:43, skipping insertion in model container [2024-10-11 09:59:43,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:59:39" (2/3) ... [2024-10-11 09:59:43,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181dcf7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:59:43, skipping insertion in model container [2024-10-11 09:59:43,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:59:43" (3/3) ... [2024-10-11 09:59:43,974 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-11 09:59:43,992 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:59:43,993 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:59:44,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:59:44,086 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;@3f9c4b36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:59:44,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:59:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 09:59:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-11 09:59:44,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:44,112 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:44,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:44,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2048442452, now seen corresponding path program 1 times [2024-10-11 09:59:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:59:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303483225] [2024-10-11 09:59:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:44,137 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-11 09:59:44,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:59:44,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 09:59:44,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:59:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:44,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:59:44,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:59:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2024-10-11 09:59:44,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:59:44,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:59:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303483225] [2024-10-11 09:59:44,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303483225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:59:44,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:59:44,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:59:44,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554009735] [2024-10-11 09:59:44,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:44,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:59:44,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:59:44,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:59:44,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:59:44,814 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 09:59:46,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:46,659 INFO L93 Difference]: Finished difference Result 176 states and 321 transitions. [2024-10-11 09:59:46,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:59:46,688 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2024-10-11 09:59:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:46,697 INFO L225 Difference]: With dead ends: 176 [2024-10-11 09:59:46,697 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 09:59:46,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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-11 09:59:46,705 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:46,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 09:59:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 09:59:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 09:59:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 09:59:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 138 transitions. [2024-10-11 09:59:46,757 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 138 transitions. Word has length 204 [2024-10-11 09:59:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:46,759 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 138 transitions. [2024-10-11 09:59:46,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 09:59:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 138 transitions. [2024-10-11 09:59:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-11 09:59:46,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:46,765 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:46,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 09:59:46,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 09:59:46,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:46,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:46,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1488514898, now seen corresponding path program 1 times [2024-10-11 09:59:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:59:46,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533511585] [2024-10-11 09:59:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:46,974 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-11 09:59:46,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:59:46,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 09:59:46,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:59:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:47,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 09:59:47,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:59:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 848 proven. 24 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2024-10-11 09:59:47,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:59:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 09:59:48,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:59:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533511585] [2024-10-11 09:59:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533511585] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:59:48,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:59:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 09:59:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236345883] [2024-10-11 09:59:48,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:59:48,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:59:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:59:48,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:59:48,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:59:48,441 INFO L87 Difference]: Start difference. First operand 87 states and 138 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-11 09:59:51,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:51,299 INFO L93 Difference]: Finished difference Result 179 states and 280 transitions. [2024-10-11 09:59:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:59:51,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 204 [2024-10-11 09:59:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:51,338 INFO L225 Difference]: With dead ends: 179 [2024-10-11 09:59:51,339 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 09:59:51,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:59:51,341 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 141 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:51,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 222 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 09:59:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 09:59:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-11 09:59:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 09:59:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2024-10-11 09:59:51,358 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 204 [2024-10-11 09:59:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:51,359 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2024-10-11 09:59:51,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-11 09:59:51,359 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2024-10-11 09:59:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-11 09:59:51,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:51,363 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:51,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:59:51,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 09:59:51,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:51,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:51,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1526588720, now seen corresponding path program 1 times [2024-10-11 09:59:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:59:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399316578] [2024-10-11 09:59:51,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:51,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:59:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:59:51,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 09:59:51,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:59:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:51,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 09:59:51,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:59:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 09:59:54,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:59:54,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:59:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399316578] [2024-10-11 09:59:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399316578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:59:54,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:59:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:59:54,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481415166] [2024-10-11 09:59:54,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:54,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:59:54,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:59:54,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:59:54,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:59:54,233 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:56,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:58,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:58,388 INFO L93 Difference]: Finished difference Result 288 states and 444 transitions. [2024-10-11 09:59:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:59:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-10-11 09:59:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:58,422 INFO L225 Difference]: With dead ends: 288 [2024-10-11 09:59:58,422 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 09:59:58,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:59:58,424 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 102 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:58,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 388 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 09:59:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 09:59:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2024-10-11 09:59:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 107 states have internal predecessors, (142), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 09:59:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 274 transitions. [2024-10-11 09:59:58,491 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 274 transitions. Word has length 204 [2024-10-11 09:59:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:58,492 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 274 transitions. [2024-10-11 09:59:58,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 09:59:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 274 transitions. [2024-10-11 09:59:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-11 09:59:58,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:58,500 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:59:58,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:59:58,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 09:59:58,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash 274530804, now seen corresponding path program 1 times [2024-10-11 09:59:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:59:58,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257629351] [2024-10-11 09:59:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:58,703 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-11 09:59:58,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:59:58,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 09:59:58,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:59:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:59,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 09:59:59,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:59:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-10-11 09:59:59,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:00:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 10:00:00,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:00:00,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257629351] [2024-10-11 10:00:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257629351] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:00:00,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:00:00,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 10:00:00,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098773435] [2024-10-11 10:00:00,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:00:00,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:00:00,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:00:00,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:00:00,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:00:00,389 INFO L87 Difference]: Start difference. First operand 178 states and 274 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-11 10:00:05,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:00:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:00:06,327 INFO L93 Difference]: Finished difference Result 454 states and 681 transitions. [2024-10-11 10:00:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 10:00:06,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 205 [2024-10-11 10:00:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:00:06,331 INFO L225 Difference]: With dead ends: 454 [2024-10-11 10:00:06,332 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 10:00:06,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-11 10:00:06,334 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 185 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:00:06,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 420 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-11 10:00:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 10:00:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 186. [2024-10-11 10:00:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 113 states have internal predecessors, (143), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 10:00:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 275 transitions. [2024-10-11 10:00:06,382 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 275 transitions. Word has length 205 [2024-10-11 10:00:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:00:06,383 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 275 transitions. [2024-10-11 10:00:06,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-11 10:00:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 275 transitions. [2024-10-11 10:00:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-11 10:00:06,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:06,386 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 10:00:06,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 10:00:06,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 10:00:06,587 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:06,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:06,588 INFO L85 PathProgramCache]: Analyzing trace with hash -534815822, now seen corresponding path program 1 times [2024-10-11 10:00:06,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:00:06,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803640767] [2024-10-11 10:00:06,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:06,589 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-11 10:00:06,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:00:06,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 10:00:06,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 10:00:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:07,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 10:00:07,056 INFO L278 TraceCheckSpWp]: Computing forward predicates...