./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_fillercodesize_ps-cn-25_file-53.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_fillercodesize_ps-cn-25_file-53.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 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:27:02,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:27:03,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:27:03,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:27:03,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:27:03,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:27:03,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:27:03,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:27:03,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:27:03,043 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:27:03,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:27:03,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:27:03,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:27:03,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:27:03,044 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:27:03,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:27:03,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:27:03,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:27:03,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:27:03,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:27:03,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:27:03,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:27:03,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:27:03,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:27:03,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:27:03,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:27:03,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:27:03,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:27:03,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:27:03,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:27:03,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:27:03,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:27:03,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:27:03,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:27:03,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:27:03,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:27:03,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:27:03,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:27:03,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:27:03,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:27:03,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:27:03,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:27:03,055 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 -> 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd [2024-10-11 08:27:03,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:27:03,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:27:03,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:27:03,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:27:03,255 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:27:03,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-10-11 08:27:04,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:27:04,632 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:27:04,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-10-11 08:27:04,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/19da063cf/cb021cf648574c999ec5f27a902cf59e/FLAG44fcc51d0 [2024-10-11 08:27:05,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/19da063cf/cb021cf648574c999ec5f27a902cf59e [2024-10-11 08:27:05,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:27:05,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:27:05,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:27:05,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:27:05,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:27:05,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6181fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05, skipping insertion in model container [2024-10-11 08:27:05,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:27:05,226 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_fillercodesize_ps-cn-25_file-53.i[915,928] [2024-10-11 08:27:05,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:27:05,305 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:27:05,315 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_fillercodesize_ps-cn-25_file-53.i[915,928] [2024-10-11 08:27:05,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:27:05,367 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:27:05,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05 WrapperNode [2024-10-11 08:27:05,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:27:05,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:27:05,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:27:05,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:27:05,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,418 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 266 [2024-10-11 08:27:05,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:27:05,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:27:05,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:27:05,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:27:05,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,448 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 08:27:05,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:27:05,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:27:05,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:27:05,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:27:05,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (1/1) ... [2024-10-11 08:27:05,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:27:05,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:27:05,504 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 08:27:05,506 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 08:27:05,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:27:05,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:27:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:27:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:27:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:27:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:27:05,624 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:27:05,626 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:27:05,975 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 08:27:05,975 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:27:05,999 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:27:05,999 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:27:06,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:05 BoogieIcfgContainer [2024-10-11 08:27:06,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:27:06,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:27:06,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:27:06,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:27:06,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:27:05" (1/3) ... [2024-10-11 08:27:06,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6d4a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:06, skipping insertion in model container [2024-10-11 08:27:06,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:05" (2/3) ... [2024-10-11 08:27:06,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6d4a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:06, skipping insertion in model container [2024-10-11 08:27:06,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:05" (3/3) ... [2024-10-11 08:27:06,007 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-10-11 08:27:06,018 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:27:06,019 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:27:06,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:27:06,076 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;@65a50fa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:27:06,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:27:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 08:27:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 08:27:06,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:06,092 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:06,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:06,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash -875112049, now seen corresponding path program 1 times [2024-10-11 08:27:06,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:06,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130110225] [2024-10-11 08:27:06,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:27:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:27:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:27:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:27:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:27:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:27:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:27:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:27:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:27:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:27:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:27:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:27:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:27:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:27:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:27:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:27:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:27:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:27:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:27:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:27:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:27:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:27:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:27:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:27:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:27:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:06,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:06,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130110225] [2024-10-11 08:27:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130110225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:06,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:27:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858330240] [2024-10-11 08:27:06,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:06,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:27:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:27:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:27:06,598 INFO L87 Difference]: Start difference. First operand has 105 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 08:27:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:06,640 INFO L93 Difference]: Finished difference Result 207 states and 357 transitions. [2024-10-11 08:27:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:27:06,642 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2024-10-11 08:27:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:06,650 INFO L225 Difference]: With dead ends: 207 [2024-10-11 08:27:06,650 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 08:27:06,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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 08:27:06,660 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:06,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:27:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 08:27:06,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 08:27:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 08:27:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 159 transitions. [2024-10-11 08:27:06,701 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 159 transitions. Word has length 198 [2024-10-11 08:27:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:06,701 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 159 transitions. [2024-10-11 08:27:06,702 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 08:27:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 159 transitions. [2024-10-11 08:27:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 08:27:06,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:06,705 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:06,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:27:06,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:06,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:06,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1853521105, now seen corresponding path program 1 times [2024-10-11 08:27:06,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:06,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78055404] [2024-10-11 08:27:06,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:06,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:27:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:27:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:27:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:27:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:27:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:27:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:27:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:27:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:27:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:27:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:27:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:27:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:27:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:27:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:27:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:27:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:27:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:27:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:27:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:27:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:27:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:27:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:27:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:27:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:27:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78055404] [2024-10-11 08:27:06,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78055404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:06,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:06,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:27:06,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387441079] [2024-10-11 08:27:06,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:06,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:27:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:06,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:27:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:27:06,976 INFO L87 Difference]: Start difference. First operand 103 states and 159 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:07,054 INFO L93 Difference]: Finished difference Result 298 states and 460 transitions. [2024-10-11 08:27:07,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:27:07,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-10-11 08:27:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:07,058 INFO L225 Difference]: With dead ends: 298 [2024-10-11 08:27:07,058 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 08:27:07,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:27:07,060 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 138 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:07,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 412 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:27:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 08:27:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2024-10-11 08:27:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 129 states have (on average 1.3488372093023255) internal successors, (174), 129 states have internal predecessors, (174), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 08:27:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 298 transitions. [2024-10-11 08:27:07,104 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 298 transitions. Word has length 198 [2024-10-11 08:27:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:07,105 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 298 transitions. [2024-10-11 08:27:07,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 298 transitions. [2024-10-11 08:27:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 08:27:07,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:07,109 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:07,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:27:07,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:07,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:07,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1195160717, now seen corresponding path program 1 times [2024-10-11 08:27:07,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:07,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134092195] [2024-10-11 08:27:07,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:07,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:27:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:27:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:27:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:27:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:27:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:27:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:27:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:27:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:27:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:27:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:27:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:27:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:27:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:27:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:27:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:27:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:27:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:27:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:27:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:27:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:27:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:27:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:27:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:27:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:27:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:07,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:07,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134092195] [2024-10-11 08:27:07,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134092195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:07,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:07,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:27:07,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847553664] [2024-10-11 08:27:07,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:07,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:27:07,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:27:07,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:27:07,420 INFO L87 Difference]: Start difference. First operand 194 states and 298 transitions. 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:07,685 INFO L93 Difference]: Finished difference Result 631 states and 963 transitions. [2024-10-11 08:27:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:27:07,685 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-10-11 08:27:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:07,689 INFO L225 Difference]: With dead ends: 631 [2024-10-11 08:27:07,689 INFO L226 Difference]: Without dead ends: 438 [2024-10-11 08:27:07,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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 08:27:07,693 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 160 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:07,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 461 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:27:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-11 08:27:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 422. [2024-10-11 08:27:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 293 states have (on average 1.3515358361774743) internal successors, (396), 293 states have internal predecessors, (396), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 08:27:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 644 transitions. [2024-10-11 08:27:07,753 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 644 transitions. Word has length 199 [2024-10-11 08:27:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:07,755 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 644 transitions. [2024-10-11 08:27:07,755 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 644 transitions. [2024-10-11 08:27:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 08:27:07,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:07,760 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:07,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:27:07,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:07,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 497062627, now seen corresponding path program 1 times [2024-10-11 08:27:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:07,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523314848] [2024-10-11 08:27:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:07,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:27:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:27:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:27:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:27:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:27:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:27:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:27:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:27:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:27:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:27:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:27:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:27:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:27:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:27:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:27:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:27:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:27:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:27:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:27:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:27:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:27:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:27:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:27:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:27:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:27:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:08,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523314848] [2024-10-11 08:27:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523314848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:08,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:08,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:27:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116331870] [2024-10-11 08:27:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:08,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:27:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:08,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:27:08,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:27:08,003 INFO L87 Difference]: Start difference. First operand 422 states and 644 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:08,061 INFO L93 Difference]: Finished difference Result 1065 states and 1630 transitions. [2024-10-11 08:27:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:27:08,062 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-10-11 08:27:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:08,066 INFO L225 Difference]: With dead ends: 1065 [2024-10-11 08:27:08,066 INFO L226 Difference]: Without dead ends: 644 [2024-10-11 08:27:08,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 08:27:08,068 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 88 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:08,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 301 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:27:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-11 08:27:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2024-10-11 08:27:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 449 states have (on average 1.3474387527839644) internal successors, (605), 449 states have internal predecessors, (605), 186 states have call successors, (186), 6 states have call predecessors, (186), 6 states have return successors, (186), 186 states have call predecessors, (186), 186 states have call successors, (186) [2024-10-11 08:27:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 977 transitions. [2024-10-11 08:27:08,129 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 977 transitions. Word has length 200 [2024-10-11 08:27:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:08,129 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 977 transitions. [2024-10-11 08:27:08,130 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 977 transitions. [2024-10-11 08:27:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 08:27:08,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:08,131 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:08,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:27:08,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:08,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:08,132 INFO L85 PathProgramCache]: Analyzing trace with hash 828685523, now seen corresponding path program 1 times [2024-10-11 08:27:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:08,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779195248] [2024-10-11 08:27:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:08,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:27:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:27:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:27:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:27:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:27:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:27:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:27:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:27:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:27:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:27:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:27:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:27:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:27:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:27:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:27:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:27:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:27:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:27:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:27:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:27:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:27:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:27:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:27:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:27:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:27:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:08,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:08,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779195248] [2024-10-11 08:27:08,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779195248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:08,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:08,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:27:08,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102588733] [2024-10-11 08:27:08,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:08,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:27:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:08,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:27:08,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:27:08,257 INFO L87 Difference]: Start difference. First operand 642 states and 977 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:08,395 INFO L93 Difference]: Finished difference Result 1885 states and 2874 transitions. [2024-10-11 08:27:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:27:08,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-10-11 08:27:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:08,407 INFO L225 Difference]: With dead ends: 1885 [2024-10-11 08:27:08,407 INFO L226 Difference]: Without dead ends: 1244 [2024-10-11 08:27:08,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 08:27:08,411 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 152 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:08,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 424 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:27:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-10-11 08:27:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 654. [2024-10-11 08:27:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 461 states have (on average 1.3383947939262473) internal successors, (617), 461 states have internal predecessors, (617), 186 states have call successors, (186), 6 states have call predecessors, (186), 6 states have return successors, (186), 186 states have call predecessors, (186), 186 states have call successors, (186) [2024-10-11 08:27:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 989 transitions. [2024-10-11 08:27:08,485 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 989 transitions. Word has length 201 [2024-10-11 08:27:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:08,485 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 989 transitions. [2024-10-11 08:27:08,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 989 transitions. [2024-10-11 08:27:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 08:27:08,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:08,487 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:08,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:27:08,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:08,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash 435658513, now seen corresponding path program 1 times [2024-10-11 08:27:08,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:08,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798239706] [2024-10-11 08:27:08,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:08,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:27:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:27:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:27:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:27:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:27:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:27:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:27:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:27:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:27:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:27:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:27:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:27:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:27:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:27:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:27:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:27:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:27:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:27:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:27:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:27:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:27:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:27:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:27:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:27:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:27:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:08,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:08,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798239706] [2024-10-11 08:27:08,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798239706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:08,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:08,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:27:08,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906563839] [2024-10-11 08:27:08,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:08,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:27:08,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:08,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:27:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:27:08,729 INFO L87 Difference]: Start difference. First operand 654 states and 989 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:08,866 INFO L93 Difference]: Finished difference Result 1804 states and 2713 transitions. [2024-10-11 08:27:08,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:27:08,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-10-11 08:27:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:08,873 INFO L225 Difference]: With dead ends: 1804 [2024-10-11 08:27:08,873 INFO L226 Difference]: Without dead ends: 1151 [2024-10-11 08:27:08,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:27:08,876 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 115 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:08,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 546 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:27:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-10-11 08:27:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1143. [2024-10-11 08:27:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 842 states have (on average 1.3491686460807601) internal successors, (1136), 848 states have internal predecessors, (1136), 288 states have call successors, (288), 12 states have call predecessors, (288), 12 states have return successors, (288), 282 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-11 08:27:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1712 transitions. [2024-10-11 08:27:08,978 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1712 transitions. Word has length 201 [2024-10-11 08:27:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:08,979 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1712 transitions. [2024-10-11 08:27:08,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1712 transitions. [2024-10-11 08:27:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 08:27:08,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:08,981 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:08,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 08:27:08,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:08,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:08,982 INFO L85 PathProgramCache]: Analyzing trace with hash 373618899, now seen corresponding path program 1 times [2024-10-11 08:27:08,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:08,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185739347] [2024-10-11 08:27:08,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:08,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:27:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:27:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:27:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:27:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:27:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:27:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:27:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:27:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:27:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:27:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:27:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:27:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:27:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:27:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:27:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:27:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:27:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:27:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:27:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:27:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:27:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:27:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:27:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:27:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:27:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-11 08:27:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185739347] [2024-10-11 08:27:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185739347] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:27:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330281986] [2024-10-11 08:27:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:09,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:27:09,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:27:09,375 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 08:27:09,377 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 08:27:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:09,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 08:27:09,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-10-11 08:27:10,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:27:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-11 08:27:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330281986] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:27:10,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:27:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 20 [2024-10-11 08:27:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702700081] [2024-10-11 08:27:10,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:27:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 08:27:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 08:27:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-10-11 08:27:10,412 INFO L87 Difference]: Start difference. First operand 1143 states and 1712 transitions. Second operand has 20 states, 20 states have (on average 5.9) internal successors, (118), 20 states have internal predecessors, (118), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2024-10-11 08:27:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:12,443 INFO L93 Difference]: Finished difference Result 3706 states and 5430 transitions. [2024-10-11 08:27:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-11 08:27:12,444 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.9) internal successors, (118), 20 states have internal predecessors, (118), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) Word has length 201 [2024-10-11 08:27:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:12,457 INFO L225 Difference]: With dead ends: 3706 [2024-10-11 08:27:12,457 INFO L226 Difference]: Without dead ends: 2564 [2024-10-11 08:27:12,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 454 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=739, Invalid=2683, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 08:27:12,462 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 891 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 2327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:12,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 2256 Invalid, 2327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 08:27:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-10-11 08:27:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1227. [2024-10-11 08:27:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 880 states have (on average 1.3204545454545455) internal successors, (1162), 887 states have internal predecessors, (1162), 319 states have call successors, (319), 27 states have call predecessors, (319), 27 states have return successors, (319), 312 states have call predecessors, (319), 319 states have call successors, (319) [2024-10-11 08:27:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1800 transitions. [2024-10-11 08:27:12,649 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1800 transitions. Word has length 201 [2024-10-11 08:27:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:12,650 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1800 transitions. [2024-10-11 08:27:12,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.9) internal successors, (118), 20 states have internal predecessors, (118), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2024-10-11 08:27:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1800 transitions. [2024-10-11 08:27:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 08:27:12,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:12,652 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:12,667 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 08:27:12,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:27:12,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:12,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1423233192, now seen corresponding path program 1 times [2024-10-11 08:27:12,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:12,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527284952] [2024-10-11 08:27:12,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:12,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:27:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:27:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:27:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:27:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:27:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:27:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:27:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:27:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:27:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:27:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:27:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:27:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:27:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:27:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:27:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:27:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:27:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:27:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:27:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:27:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:27:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:27:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:27:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:27:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:27:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:13,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527284952] [2024-10-11 08:27:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527284952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:13,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:13,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:27:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426751990] [2024-10-11 08:27:13,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:13,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:27:13,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:13,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:27:13,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:27:13,066 INFO L87 Difference]: Start difference. First operand 1227 states and 1800 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:13,188 INFO L93 Difference]: Finished difference Result 1229 states and 1801 transitions. [2024-10-11 08:27:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:27:13,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-10-11 08:27:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:13,192 INFO L225 Difference]: With dead ends: 1229 [2024-10-11 08:27:13,192 INFO L226 Difference]: Without dead ends: 465 [2024-10-11 08:27:13,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:27:13,195 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:13,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 143 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:27:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-11 08:27:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2024-10-11 08:27:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 326 states have (on average 1.2760736196319018) internal successors, (416), 329 states have internal predecessors, (416), 127 states have call successors, (127), 11 states have call predecessors, (127), 11 states have return successors, (127), 124 states have call predecessors, (127), 127 states have call successors, (127) [2024-10-11 08:27:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 670 transitions. [2024-10-11 08:27:13,238 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 670 transitions. Word has length 201 [2024-10-11 08:27:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:13,239 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 670 transitions. [2024-10-11 08:27:13,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 670 transitions. [2024-10-11 08:27:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-11 08:27:13,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:13,242 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:13,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 08:27:13,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:13,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:13,243 INFO L85 PathProgramCache]: Analyzing trace with hash -528553425, now seen corresponding path program 1 times [2024-10-11 08:27:13,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:13,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101105043] [2024-10-11 08:27:13,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:13,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:27:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:27:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:27:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:27:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:27:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:27:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:27:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:27:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:27:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:27:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:27:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:27:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:27:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:27:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:27:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:27:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:27:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:27:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:27:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:27:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:27:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:27:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:27:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:27:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:27:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-11 08:27:13,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:13,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101105043] [2024-10-11 08:27:13,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101105043] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:27:13,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039915759] [2024-10-11 08:27:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:13,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:27:13,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:27:13,548 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 08:27:13,549 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 08:27:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:13,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 08:27:13,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 654 proven. 18 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2024-10-11 08:27:13,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:27:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-11 08:27:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039915759] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:27:14,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:27:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2024-10-11 08:27:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983837307] [2024-10-11 08:27:14,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:27:14,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 08:27:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 08:27:14,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-10-11 08:27:14,217 INFO L87 Difference]: Start difference. First operand 465 states and 670 transitions. Second operand has 17 states, 17 states have (on average 6.647058823529412) internal successors, (113), 17 states have internal predecessors, (113), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-10-11 08:27:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:14,902 INFO L93 Difference]: Finished difference Result 1693 states and 2408 transitions. [2024-10-11 08:27:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 08:27:14,903 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.647058823529412) internal successors, (113), 17 states have internal predecessors, (113), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 202 [2024-10-11 08:27:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:14,909 INFO L225 Difference]: With dead ends: 1693 [2024-10-11 08:27:14,910 INFO L226 Difference]: Without dead ends: 1289 [2024-10-11 08:27:14,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-10-11 08:27:14,913 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 494 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:14,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 627 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 08:27:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-10-11 08:27:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1247. [2024-10-11 08:27:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 911 states have (on average 1.283205268935236) internal successors, (1169), 920 states have internal predecessors, (1169), 305 states have call successors, (305), 30 states have call predecessors, (305), 30 states have return successors, (305), 296 states have call predecessors, (305), 305 states have call successors, (305) [2024-10-11 08:27:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1779 transitions. [2024-10-11 08:27:15,063 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1779 transitions. Word has length 202 [2024-10-11 08:27:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:15,063 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1779 transitions. [2024-10-11 08:27:15,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.647058823529412) internal successors, (113), 17 states have internal predecessors, (113), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-10-11 08:27:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1779 transitions. [2024-10-11 08:27:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-11 08:27:15,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:15,065 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:15,079 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 08:27:15,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:27:15,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:15,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2139440522, now seen corresponding path program 1 times [2024-10-11 08:27:15,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:15,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960433156] [2024-10-11 08:27:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:27:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:27:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:27:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:27:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:27:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:27:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:27:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:27:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:27:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:27:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:27:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:27:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:27:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:27:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:27:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:27:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:27:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:27:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:27:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:27:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:27:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:27:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:27:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:27:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:27:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:27:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:27:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:27:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:27:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 08:27:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 08:27:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:15,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:27:15,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960433156] [2024-10-11 08:27:15,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960433156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:15,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:15,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:27:15,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525268754] [2024-10-11 08:27:15,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:15,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:27:15,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:27:15,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:27:15,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:27:15,557 INFO L87 Difference]: Start difference. First operand 1247 states and 1779 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:15,775 INFO L93 Difference]: Finished difference Result 2435 states and 3470 transitions. [2024-10-11 08:27:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:27:15,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2024-10-11 08:27:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:15,782 INFO L225 Difference]: With dead ends: 2435 [2024-10-11 08:27:15,782 INFO L226 Difference]: Without dead ends: 1253 [2024-10-11 08:27:15,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:27:15,785 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 205 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:15,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 412 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:27:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-10-11 08:27:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1247. [2024-10-11 08:27:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 911 states have (on average 1.278814489571899) internal successors, (1165), 920 states have internal predecessors, (1165), 305 states have call successors, (305), 30 states have call predecessors, (305), 30 states have return successors, (305), 296 states have call predecessors, (305), 305 states have call successors, (305) [2024-10-11 08:27:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1775 transitions. [2024-10-11 08:27:15,900 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1775 transitions. Word has length 204 [2024-10-11 08:27:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:15,900 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1775 transitions. [2024-10-11 08:27:15,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1775 transitions. [2024-10-11 08:27:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-11 08:27:15,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:15,902 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:15,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 08:27:15,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:15,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:15,903 INFO L85 PathProgramCache]: Analyzing trace with hash 753237128, now seen corresponding path program 1 times [2024-10-11 08:27:15,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:27:15,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182253888] [2024-10-11 08:27:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:15,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:27:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:27:15,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941560304] [2024-10-11 08:27:15,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:15,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:27:15,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:27:15,974 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 08:27:15,976 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 08:27:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:27:16,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:27:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:27:16,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:27:16,291 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:27:16,291 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:27:16,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 08:27:16,493 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 08:27:16,496 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:16,608 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:27:16,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:27:16 BoogieIcfgContainer [2024-10-11 08:27:16,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:27:16,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:27:16,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:27:16,610 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:27:16,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:05" (3/4) ... [2024-10-11 08:27:16,612 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:27:16,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:27:16,613 INFO L158 Benchmark]: Toolchain (without parser) took 11577.63ms. Allocated memory was 127.9MB in the beginning and 364.9MB in the end (delta: 237.0MB). Free memory was 59.2MB in the beginning and 222.9MB in the end (delta: -163.7MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2024-10-11 08:27:16,613 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:27:16,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.47ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 58.9MB in the beginning and 131.6MB in the end (delta: -72.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-10-11 08:27:16,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.80ms. Allocated memory is still 169.9MB. Free memory was 131.6MB in the beginning and 127.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:27:16,614 INFO L158 Benchmark]: Boogie Preprocessor took 54.76ms. Allocated memory is still 169.9MB. Free memory was 127.4MB in the beginning and 123.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:27:16,614 INFO L158 Benchmark]: RCFGBuilder took 522.72ms. Allocated memory is still 169.9MB. Free memory was 123.2MB in the beginning and 90.7MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 08:27:16,614 INFO L158 Benchmark]: TraceAbstraction took 10608.58ms. Allocated memory was 169.9MB in the beginning and 364.9MB in the end (delta: 195.0MB). Free memory was 89.7MB in the beginning and 222.9MB in the end (delta: -133.3MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2024-10-11 08:27:16,614 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 364.9MB. Free memory is still 222.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:27:16,615 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.09ms. Allocated memory is still 127.9MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.47ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 58.9MB in the beginning and 131.6MB in the end (delta: -72.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.80ms. Allocated memory is still 169.9MB. Free memory was 131.6MB in the beginning and 127.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.76ms. Allocated memory is still 169.9MB. Free memory was 127.4MB in the beginning and 123.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 522.72ms. Allocated memory is still 169.9MB. Free memory was 123.2MB in the beginning and 90.7MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10608.58ms. Allocated memory was 169.9MB in the beginning and 364.9MB in the end (delta: 195.0MB). Free memory was 89.7MB in the beginning and 222.9MB in the end (delta: -133.3MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 364.9MB. Free memory is still 222.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of shiftLeft at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 93, overapproximation of someUnaryFLOAToperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] signed short int var_1_25 = 5; [L41] unsigned short int var_1_26 = 500; [L42] unsigned char var_1_27 = 1; [L43] signed short int var_1_28 = -32; [L44] unsigned short int var_1_29 = 54921; [L45] unsigned char var_1_30 = 1; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 0; [L48] double var_1_33 = 10000000000000.8; [L49] float var_1_34 = 0.125; [L50] float var_1_35 = 8.5; [L51] float var_1_36 = 7.5; [L52] float var_1_37 = 3.2; [L53] unsigned char last_1_var_1_1 = 0; [L54] unsigned long int last_1_var_1_9 = 10; [L55] signed short int last_1_var_1_14 = 32; [L56] unsigned char last_1_var_1_16 = 1; [L57] signed char last_1_var_1_20 = 1; [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_9 = var_1_9 [L174] last_1_var_1_14 = var_1_14 [L175] last_1_var_1_16 = var_1_16 [L176] last_1_var_1_20 = var_1_20 [L186] RET updateLastVariables() [L187] CALL updateVariables() [L122] var_1_8 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L124] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L124] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L125] var_1_11 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L126] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L127] var_1_12 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L128] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L129] var_1_13 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L130] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L131] var_1_15 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L132] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L133] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L133] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L134] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L134] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L135] var_1_17 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L136] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L137] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L137] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L138] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L138] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L139] var_1_18 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L140] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L141] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L141] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L142] var_1_19 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L143] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L144] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L145] var_1_21 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L146] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L147] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L147] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L148] var_1_25 = __VERIFIER_nondet_short() [L149] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L149] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L150] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L150] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L151] var_1_27 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L153] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L153] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L154] var_1_28 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L155] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L156] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L156] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L157] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L157] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L158] var_1_29 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L159] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L160] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L160] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L161] var_1_31 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L162] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L163] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L163] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L164] var_1_35 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 4611686.018427382800e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L165] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 4611686.018427382800e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L166] var_1_36 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L167] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L168] var_1_37 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_37 >= -461168.6018427382800e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L169] RET assume_abort_if_not((var_1_37 >= -461168.6018427382800e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L187] RET updateVariables() [L188] CALL step() [L61] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L62] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L67] COND TRUE ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29))) >= ((((-16) > (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))) ? (-16) : (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))) [L68] var_1_30 = (! var_1_31) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L70] var_1_32 = 1 [L71] var_1_33 = 5.25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR var_1_26 >> var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR ((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR var_1_26 >> var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR ((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] COND FALSE !(((((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)))) <= var_1_28) [L77] var_1_34 = var_1_35 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L79] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L80] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L81] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L86] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L87] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L87] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L88] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L90] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L91] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L92] COND TRUE (! var_1_1) || stepLocal_4 [L93] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L101] var_1_20 = var_1_21 [L102] var_1_22 = var_1_12 [L103] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L104] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L107] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L107] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L108] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L113] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L114] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L115] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L116] COND TRUE stepLocal_2 <= (-5 + var_1_16) [L117] var_1_9 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=5] [L188] RET step() [L189] CALL, EXPR property() [L179] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=5] [L179] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=5] [L179-L180] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=5, var_1_15=10, var_1_16=5, var_1_17=11, var_1_18=0, var_1_19=5, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 11, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2475 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2395 mSDsluCounter, 5738 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3680 mSDsCounter, 940 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2633 IncrementalHoareTripleChecker+Invalid, 3573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 940 mSolverCounterUnsat, 2058 mSDtfsCounter, 2633 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1555 GetRequests, 1457 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1247occurred in iteration=9, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 2003 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2816 NumberOfCodeBlocks, 2816 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2797 ConstructedInterpolants, 0 QuantifiedInterpolants, 6870 SizeOfPredicates, 7 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 25851/26040 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 08:27:16,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercodesize_ps-cn-25_file-53.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 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:27:18,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:27:18,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:27:18,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:27:18,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:27:18,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:27:18,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:27:18,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:27:18,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:27:18,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:27:18,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:27:18,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:27:18,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:27:18,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:27:18,499 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:27:18,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:27:18,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:27:18,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:27:18,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:27:18,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:27:18,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:27:18,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:27:18,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:27:18,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:27:18,504 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:27:18,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:27:18,504 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:27:18,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:27:18,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:27:18,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:27:18,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:27:18,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:27:18,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:27:18,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:27:18,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:27:18,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:27:18,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:27:18,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:27:18,506 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:27:18,507 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:27:18,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:27:18,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:27:18,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:27:18,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:27:18,508 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:27:18,508 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 -> 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd [2024-10-11 08:27:18,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:27:18,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:27:18,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:27:18,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:27:18,784 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:27:18,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-10-11 08:27:20,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:27:20,250 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:27:20,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-10-11 08:27:20,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe0919479/a2a9a882b910409fbc41cb43172845e4/FLAG9bd5269f7 [2024-10-11 08:27:20,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe0919479/a2a9a882b910409fbc41cb43172845e4 [2024-10-11 08:27:20,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:27:20,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:27:20,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:27:20,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:27:20,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:27:20,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398bca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20, skipping insertion in model container [2024-10-11 08:27:20,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:27:20,464 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_fillercodesize_ps-cn-25_file-53.i[915,928] [2024-10-11 08:27:20,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:27:20,534 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:27:20,544 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_fillercodesize_ps-cn-25_file-53.i[915,928] [2024-10-11 08:27:20,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:27:20,581 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:27:20,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20 WrapperNode [2024-10-11 08:27:20,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:27:20,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:27:20,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:27:20,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:27:20,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,629 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-10-11 08:27:20,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:27:20,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:27:20,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:27:20,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:27:20,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,665 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 08:27:20,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:27:20,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:27:20,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:27:20,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:27:20,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (1/1) ... [2024-10-11 08:27:20,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:27:20,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:27:20,733 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 08:27:20,735 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 08:27:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:27:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:27:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:27:20,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:27:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:27:20,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:27:20,854 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:27:20,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:27:21,509 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 08:27:21,509 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:27:21,566 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:27:21,567 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:27:21,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:21 BoogieIcfgContainer [2024-10-11 08:27:21,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:27:21,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:27:21,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:27:21,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:27:21,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:27:20" (1/3) ... [2024-10-11 08:27:21,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a088c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:21, skipping insertion in model container [2024-10-11 08:27:21,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:20" (2/3) ... [2024-10-11 08:27:21,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a088c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:21, skipping insertion in model container [2024-10-11 08:27:21,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:21" (3/3) ... [2024-10-11 08:27:21,575 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2024-10-11 08:27:21,589 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:27:21,589 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:27:21,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:27:21,642 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;@78ffe993, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:27:21,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:27:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 08:27:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-11 08:27:21,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:21,660 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:21,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:21,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash 164228638, now seen corresponding path program 1 times [2024-10-11 08:27:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429349562] [2024-10-11 08:27:21,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:21,677 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 08:27:21,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:21,679 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 08:27:21,715 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 08:27:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:21,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:27:22,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2024-10-11 08:27:22,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:27:22,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:27:22,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429349562] [2024-10-11 08:27:22,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429349562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:22,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:22,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:27:22,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384022129] [2024-10-11 08:27:22,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:22,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:27:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:27:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:27:22,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:27:22,080 INFO L87 Difference]: Start difference. First operand has 81 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 08:27:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:22,202 INFO L93 Difference]: Finished difference Result 159 states and 285 transitions. [2024-10-11 08:27:22,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:27:22,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 191 [2024-10-11 08:27:22,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:22,217 INFO L225 Difference]: With dead ends: 159 [2024-10-11 08:27:22,218 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 08:27:22,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 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 08:27:22,223 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:22,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:27:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 08:27:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 08:27:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 08:27:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2024-10-11 08:27:22,267 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 191 [2024-10-11 08:27:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:22,267 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2024-10-11 08:27:22,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 08:27:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2024-10-11 08:27:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-11 08:27:22,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:22,271 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:22,280 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 (2)] Ended with exit code 0 [2024-10-11 08:27:22,471 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 08:27:22,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:22,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:22,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1116303076, now seen corresponding path program 1 times [2024-10-11 08:27:22,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:22,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229542285] [2024-10-11 08:27:22,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:22,473 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 08:27:22,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:22,475 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 08:27:22,476 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 08:27:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:22,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:27:22,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:23,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:27:23,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:27:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229542285] [2024-10-11 08:27:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229542285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:23,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:23,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:27:23,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267343273] [2024-10-11 08:27:23,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:23,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:27:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:27:23,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:27:23,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:27:23,049 INFO L87 Difference]: Start difference. First operand 79 states and 123 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:23,389 INFO L93 Difference]: Finished difference Result 233 states and 363 transitions. [2024-10-11 08:27:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:27:23,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2024-10-11 08:27:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:23,395 INFO L225 Difference]: With dead ends: 233 [2024-10-11 08:27:23,397 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 08:27:23,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 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 08:27:23,398 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 22 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:23,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 232 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:27:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 08:27:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2024-10-11 08:27:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 08:27:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 238 transitions. [2024-10-11 08:27:23,432 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 238 transitions. Word has length 191 [2024-10-11 08:27:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:23,434 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 238 transitions. [2024-10-11 08:27:23,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 238 transitions. [2024-10-11 08:27:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 08:27:23,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:23,436 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:23,445 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 08:27:23,636 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 08:27:23,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:23,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:23,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1526201470, now seen corresponding path program 1 times [2024-10-11 08:27:23,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:23,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779073797] [2024-10-11 08:27:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:23,639 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 08:27:23,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:23,641 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 08:27:23,642 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 08:27:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:23,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:27:23,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:24,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:27:24,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:27:24,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779073797] [2024-10-11 08:27:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779073797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:24,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:24,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:27:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855035460] [2024-10-11 08:27:24,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:24,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:27:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:27:24,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:27:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:27:24,710 INFO L87 Difference]: Start difference. First operand 153 states and 238 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:25,209 INFO L93 Difference]: Finished difference Result 382 states and 592 transitions. [2024-10-11 08:27:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:27:25,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2024-10-11 08:27:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:25,222 INFO L225 Difference]: With dead ends: 382 [2024-10-11 08:27:25,222 INFO L226 Difference]: Without dead ends: 230 [2024-10-11 08:27:25,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 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 08:27:25,227 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 67 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:25,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 402 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:27:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-11 08:27:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2024-10-11 08:27:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 117 states have (on average 1.264957264957265) internal successors, (148), 117 states have internal predecessors, (148), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 08:27:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 334 transitions. [2024-10-11 08:27:25,262 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 334 transitions. Word has length 192 [2024-10-11 08:27:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:25,263 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 334 transitions. [2024-10-11 08:27:25,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 334 transitions. [2024-10-11 08:27:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 08:27:25,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:25,269 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:25,282 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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 08:27:25,473 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 08:27:25,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:25,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:25,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1401871900, now seen corresponding path program 1 times [2024-10-11 08:27:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:25,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110294667] [2024-10-11 08:27:25,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:25,475 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 08:27:25,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:25,477 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 08:27:25,478 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 08:27:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:25,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:27:25,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:27:25,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:27:25,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:27:25,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110294667] [2024-10-11 08:27:25,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110294667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:27:25,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:27:25,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:27:25,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161185922] [2024-10-11 08:27:25,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:27:25,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:27:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:27:25,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:27:25,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:27:25,737 INFO L87 Difference]: Start difference. First operand 214 states and 334 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:26,099 INFO L93 Difference]: Finished difference Result 450 states and 700 transitions. [2024-10-11 08:27:26,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:27:26,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2024-10-11 08:27:26,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:26,105 INFO L225 Difference]: With dead ends: 450 [2024-10-11 08:27:26,105 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 08:27:26,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 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 08:27:26,108 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 116 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:26,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 339 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:27:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 08:27:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2024-10-11 08:27:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 119 states have (on average 1.2605042016806722) internal successors, (150), 119 states have internal predecessors, (150), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 08:27:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 336 transitions. [2024-10-11 08:27:26,146 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 336 transitions. Word has length 192 [2024-10-11 08:27:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:26,148 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 336 transitions. [2024-10-11 08:27:26,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:27:26,149 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 336 transitions. [2024-10-11 08:27:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 08:27:26,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:26,151 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:26,163 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 (5)] Forceful destruction successful, exit code 0 [2024-10-11 08:27:26,351 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 08:27:26,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:26,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:26,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1459130202, now seen corresponding path program 1 times [2024-10-11 08:27:26,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:26,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51739952] [2024-10-11 08:27:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:26,353 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 08:27:26,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:26,355 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 08:27:26,356 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 08:27:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:26,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 08:27:26,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:27:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-10-11 08:27:26,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:27:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-11 08:27:27,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:27:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51739952] [2024-10-11 08:27:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51739952] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:27:27,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:27:27,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-10-11 08:27:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085305510] [2024-10-11 08:27:27,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:27:27,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 08:27:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:27:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 08:27:27,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 08:27:27,022 INFO L87 Difference]: Start difference. First operand 216 states and 336 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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 08:27:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:27:28,690 INFO L93 Difference]: Finished difference Result 481 states and 727 transitions. [2024-10-11 08:27:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 08:27:28,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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 192 [2024-10-11 08:27:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:27:28,702 INFO L225 Difference]: With dead ends: 481 [2024-10-11 08:27:28,702 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 08:27:28,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2024-10-11 08:27:28,704 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 330 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:27:28,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 775 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 08:27:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 08:27:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 226. [2024-10-11 08:27:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 126 states have internal predecessors, (156), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 08:27:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 342 transitions. [2024-10-11 08:27:28,745 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 342 transitions. Word has length 192 [2024-10-11 08:27:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:27:28,745 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 342 transitions. [2024-10-11 08:27:28,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 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 08:27:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 342 transitions. [2024-10-11 08:27:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 08:27:28,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:27:28,748 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:27:28,763 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 (6)] Forceful destruction successful, exit code 0 [2024-10-11 08:27:28,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 08:27:28,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:27:28,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:27:28,949 INFO L85 PathProgramCache]: Analyzing trace with hash 498015678, now seen corresponding path program 1 times [2024-10-11 08:27:28,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:27:28,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85869738] [2024-10-11 08:27:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:27:28,950 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 08:27:28,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:27:28,951 INFO L229 MonitoredProcess]: Starting monitored process 7 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 08:27:28,952 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 (7)] Waiting until timeout for monitored process [2024-10-11 08:27:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:27:29,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 08:27:29,174 INFO L278 TraceCheckSpWp]: Computing forward predicates...