./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f9bd018564099dceca052b7e7f37fc49b50d77146132d1697955eccca4510db --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:47:11,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:47:11,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:47:11,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:47:11,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:47:11,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:47:11,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:47:11,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:47:11,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:47:11,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:47:11,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:47:11,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:47:11,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:47:11,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:47:11,680 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:47:11,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:47:11,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:47:11,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:47:11,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:47:11,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:47:11,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:47:11,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:47:11,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:47:11,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:47:11,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:47:11,684 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:47:11,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:47:11,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:47:11,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:47:11,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:47:11,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:47:11,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:47:11,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:11,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:47:11,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:47:11,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:47:11,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:47:11,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:47:11,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:47:11,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:47:11,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:47:11,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:47:11,690 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f9bd018564099dceca052b7e7f37fc49b50d77146132d1697955eccca4510db [2024-11-08 21:47:11,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:47:11,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:47:11,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:47:11,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:47:11,973 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:47:11,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i [2024-11-08 21:47:13,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:47:13,614 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:47:13,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i [2024-11-08 21:47:13,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f55ea33/b190ee09ecf346bd8ddbb361c7ab2ece/FLAG7622234f8 [2024-11-08 21:47:13,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f55ea33/b190ee09ecf346bd8ddbb361c7ab2ece [2024-11-08 21:47:13,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:47:13,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:47:13,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:13,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:47:13,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:47:13,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:13" (1/1) ... [2024-11-08 21:47:13,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34541425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:13, skipping insertion in model container [2024-11-08 21:47:13,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:13" (1/1) ... [2024-11-08 21:47:13,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:47:13,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i[919,932] [2024-11-08 21:47:13,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:14,006 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:47:14,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i[919,932] [2024-11-08 21:47:14,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:14,080 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:47:14,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14 WrapperNode [2024-11-08 21:47:14,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:14,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:14,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:47:14,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:47:14,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,199 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 273 [2024-11-08 21:47:14,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:14,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:47:14,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:47:14,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:47:14,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,270 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:47:14,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:47:14,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:47:14,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:47:14,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:47:14,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (1/1) ... [2024-11-08 21:47:14,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:14,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:14,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:47:14,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:47:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:47:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:47:14,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:47:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:47:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:47:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:47:14,506 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:47:14,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:47:15,022 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 21:47:15,022 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:47:15,034 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:47:15,035 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:47:15,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:15 BoogieIcfgContainer [2024-11-08 21:47:15,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:47:15,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:47:15,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:47:15,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:47:15,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:47:13" (1/3) ... [2024-11-08 21:47:15,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594661fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:15, skipping insertion in model container [2024-11-08 21:47:15,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:14" (2/3) ... [2024-11-08 21:47:15,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594661fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:15, skipping insertion in model container [2024-11-08 21:47:15,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:15" (3/3) ... [2024-11-08 21:47:15,068 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i [2024-11-08 21:47:15,083 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:47:15,083 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:47:15,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:47:15,151 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;@23abec41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:47:15,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:47:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 84 states have internal predecessors, (122), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:47:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:47:15,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:15,172 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:15,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash -421131066, now seen corresponding path program 1 times [2024-11-08 21:47:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:15,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607487516] [2024-11-08 21:47:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607487516] [2024-11-08 21:47:15,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607487516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:15,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:15,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:47:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716952243] [2024-11-08 21:47:15,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:15,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:47:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:47:15,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:47:15,731 INFO L87 Difference]: Start difference. First operand has 116 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 84 states have internal predecessors, (122), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:47:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:15,771 INFO L93 Difference]: Finished difference Result 225 states and 388 transitions. [2024-11-08 21:47:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:47:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 199 [2024-11-08 21:47:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:15,783 INFO L225 Difference]: With dead ends: 225 [2024-11-08 21:47:15,783 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 21:47:15,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:47:15,791 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:15,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:47:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 21:47:15,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-08 21:47:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:47:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 175 transitions. [2024-11-08 21:47:15,840 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 175 transitions. Word has length 199 [2024-11-08 21:47:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:15,841 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 175 transitions. [2024-11-08 21:47:15,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:47:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 175 transitions. [2024-11-08 21:47:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:47:15,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:15,847 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:15,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:47:15,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:15,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash -529856710, now seen corresponding path program 1 times [2024-11-08 21:47:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:15,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016708572] [2024-11-08 21:47:15,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:15,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:16,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:16,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016708572] [2024-11-08 21:47:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016708572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:16,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:16,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:47:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106177710] [2024-11-08 21:47:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:16,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:47:16,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:16,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:47:16,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:47:16,364 INFO L87 Difference]: Start difference. First operand 112 states and 175 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:16,411 INFO L93 Difference]: Finished difference Result 221 states and 347 transitions. [2024-11-08 21:47:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:47:16,413 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-08 21:47:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:16,416 INFO L225 Difference]: With dead ends: 221 [2024-11-08 21:47:16,417 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 21:47:16,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:47:16,420 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:16,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:47:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 21:47:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-08 21:47:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:47:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 174 transitions. [2024-11-08 21:47:16,444 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 174 transitions. Word has length 199 [2024-11-08 21:47:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:16,450 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 174 transitions. [2024-11-08 21:47:16,450 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 174 transitions. [2024-11-08 21:47:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 21:47:16,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:16,453 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:16,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:47:16,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:16,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:16,456 INFO L85 PathProgramCache]: Analyzing trace with hash -932045717, now seen corresponding path program 1 times [2024-11-08 21:47:16,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:16,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99794583] [2024-11-08 21:47:16,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:16,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99794583] [2024-11-08 21:47:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99794583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:16,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:16,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:47:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131168560] [2024-11-08 21:47:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:16,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:47:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:16,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:47:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:47:16,920 INFO L87 Difference]: Start difference. First operand 112 states and 174 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:17,162 INFO L93 Difference]: Finished difference Result 331 states and 517 transitions. [2024-11-08 21:47:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:47:17,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-08 21:47:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:17,167 INFO L225 Difference]: With dead ends: 331 [2024-11-08 21:47:17,169 INFO L226 Difference]: Without dead ends: 222 [2024-11-08 21:47:17,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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-11-08 21:47:17,172 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 127 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:17,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 472 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:47:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-08 21:47:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2024-11-08 21:47:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 142 states have (on average 1.4225352112676057) internal successors, (202), 142 states have internal predecessors, (202), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:47:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 322 transitions. [2024-11-08 21:47:17,210 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 322 transitions. Word has length 200 [2024-11-08 21:47:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:17,211 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 322 transitions. [2024-11-08 21:47:17,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 322 transitions. [2024-11-08 21:47:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 21:47:17,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:17,214 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:17,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:47:17,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:17,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash -550217236, now seen corresponding path program 1 times [2024-11-08 21:47:17,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:17,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785339154] [2024-11-08 21:47:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:17,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:17,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:17,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785339154] [2024-11-08 21:47:17,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785339154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:17,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:17,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:47:17,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348911391] [2024-11-08 21:47:17,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:17,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:47:17,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:17,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:47:17,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:47:17,571 INFO L87 Difference]: Start difference. First operand 205 states and 322 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:17,806 INFO L93 Difference]: Finished difference Result 497 states and 781 transitions. [2024-11-08 21:47:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:47:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 201 [2024-11-08 21:47:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:17,814 INFO L225 Difference]: With dead ends: 497 [2024-11-08 21:47:17,815 INFO L226 Difference]: Without dead ends: 353 [2024-11-08 21:47:17,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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-11-08 21:47:17,816 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 198 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:17,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 520 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:47:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-08 21:47:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 335. [2024-11-08 21:47:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 241 states have internal predecessors, (347), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 21:47:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 527 transitions. [2024-11-08 21:47:17,870 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 527 transitions. Word has length 201 [2024-11-08 21:47:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:17,871 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 527 transitions. [2024-11-08 21:47:17,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 527 transitions. [2024-11-08 21:47:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 21:47:17,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:17,875 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:17,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:47:17,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:17,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1085333424, now seen corresponding path program 1 times [2024-11-08 21:47:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:17,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90795617] [2024-11-08 21:47:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90795617] [2024-11-08 21:47:18,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90795617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:18,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:18,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:47:18,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117941401] [2024-11-08 21:47:18,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:18,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:47:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:47:18,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:47:18,284 INFO L87 Difference]: Start difference. First operand 335 states and 527 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:18,387 INFO L93 Difference]: Finished difference Result 860 states and 1361 transitions. [2024-11-08 21:47:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:47:18,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 202 [2024-11-08 21:47:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:18,393 INFO L225 Difference]: With dead ends: 860 [2024-11-08 21:47:18,393 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 21:47:18,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:47:18,395 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 111 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:18,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 656 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:47:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 21:47:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 607. [2024-11-08 21:47:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 451 states have (on average 1.4634146341463414) internal successors, (660), 451 states have internal predecessors, (660), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-08 21:47:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 960 transitions. [2024-11-08 21:47:18,451 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 960 transitions. Word has length 202 [2024-11-08 21:47:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:18,453 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 960 transitions. [2024-11-08 21:47:18,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 960 transitions. [2024-11-08 21:47:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 21:47:18,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:18,456 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:18,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:47:18,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:18,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1672139438, now seen corresponding path program 1 times [2024-11-08 21:47:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:18,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741152140] [2024-11-08 21:47:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:18,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:18,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741152140] [2024-11-08 21:47:18,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741152140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:18,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:18,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:47:18,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003377980] [2024-11-08 21:47:18,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:18,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:47:18,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:18,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:47:18,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:47:18,979 INFO L87 Difference]: Start difference. First operand 607 states and 960 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:19,274 INFO L93 Difference]: Finished difference Result 1215 states and 1909 transitions. [2024-11-08 21:47:19,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:47:19,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 202 [2024-11-08 21:47:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:19,280 INFO L225 Difference]: With dead ends: 1215 [2024-11-08 21:47:19,280 INFO L226 Difference]: Without dead ends: 669 [2024-11-08 21:47:19,282 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-11-08 21:47:19,284 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 119 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:19,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 472 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:47:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-08 21:47:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 615. [2024-11-08 21:47:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 459 states have (on average 1.4531590413943356) internal successors, (667), 459 states have internal predecessors, (667), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-08 21:47:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 967 transitions. [2024-11-08 21:47:19,346 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 967 transitions. Word has length 202 [2024-11-08 21:47:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:19,346 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 967 transitions. [2024-11-08 21:47:19,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 967 transitions. [2024-11-08 21:47:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 21:47:19,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:19,349 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:19,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:47:19,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:19,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1803969969, now seen corresponding path program 1 times [2024-11-08 21:47:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:19,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100717363] [2024-11-08 21:47:19,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:19,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:19,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:19,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100717363] [2024-11-08 21:47:19,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100717363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:19,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:19,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:47:19,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850765957] [2024-11-08 21:47:19,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:19,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:47:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:19,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:47:19,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:47:19,869 INFO L87 Difference]: Start difference. First operand 615 states and 967 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:20,221 INFO L93 Difference]: Finished difference Result 1604 states and 2525 transitions. [2024-11-08 21:47:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:47:20,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 203 [2024-11-08 21:47:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:20,230 INFO L225 Difference]: With dead ends: 1604 [2024-11-08 21:47:20,230 INFO L226 Difference]: Without dead ends: 1046 [2024-11-08 21:47:20,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:47:20,234 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 277 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:20,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 586 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:47:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-08 21:47:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 870. [2024-11-08 21:47:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 652 states have (on average 1.450920245398773) internal successors, (946), 652 states have internal predecessors, (946), 210 states have call successors, (210), 7 states have call predecessors, (210), 7 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-08 21:47:20,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1366 transitions. [2024-11-08 21:47:20,350 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1366 transitions. Word has length 203 [2024-11-08 21:47:20,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:20,351 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1366 transitions. [2024-11-08 21:47:20,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1366 transitions. [2024-11-08 21:47:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 21:47:20,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:20,354 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:20,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:47:20,355 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:20,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1789397453, now seen corresponding path program 1 times [2024-11-08 21:47:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:20,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377400633] [2024-11-08 21:47:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:20,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:20,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:20,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377400633] [2024-11-08 21:47:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377400633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:20,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:20,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:47:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582533890] [2024-11-08 21:47:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:20,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:47:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:20,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:47:20,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:47:20,725 INFO L87 Difference]: Start difference. First operand 870 states and 1366 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:20,926 INFO L93 Difference]: Finished difference Result 1798 states and 2830 transitions. [2024-11-08 21:47:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:47:20,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 203 [2024-11-08 21:47:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:20,933 INFO L225 Difference]: With dead ends: 1798 [2024-11-08 21:47:20,933 INFO L226 Difference]: Without dead ends: 1114 [2024-11-08 21:47:20,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:47:20,937 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 109 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:20,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 673 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:47:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-08 21:47:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1044. [2024-11-08 21:47:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 826 states have (on average 1.4782082324455206) internal successors, (1221), 826 states have internal predecessors, (1221), 210 states have call successors, (210), 7 states have call predecessors, (210), 7 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-08 21:47:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1641 transitions. [2024-11-08 21:47:21,009 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1641 transitions. Word has length 203 [2024-11-08 21:47:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:21,010 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1641 transitions. [2024-11-08 21:47:21,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1641 transitions. [2024-11-08 21:47:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 21:47:21,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:21,013 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:21,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 21:47:21,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:21,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 232439710, now seen corresponding path program 1 times [2024-11-08 21:47:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422497265] [2024-11-08 21:47:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:21,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422497265] [2024-11-08 21:47:21,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422497265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:21,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:21,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:47:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796171983] [2024-11-08 21:47:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:47:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:47:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:47:21,877 INFO L87 Difference]: Start difference. First operand 1044 states and 1641 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:47:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:22,656 INFO L93 Difference]: Finished difference Result 2804 states and 4368 transitions. [2024-11-08 21:47:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:47:22,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 208 [2024-11-08 21:47:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:22,667 INFO L225 Difference]: With dead ends: 2804 [2024-11-08 21:47:22,667 INFO L226 Difference]: Without dead ends: 1844 [2024-11-08 21:47:22,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:47:22,671 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 403 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:22,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 550 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 21:47:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-11-08 21:47:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1644. [2024-11-08 21:47:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1343 states have (on average 1.4802680565897246) internal successors, (1988), 1347 states have internal predecessors, (1988), 286 states have call successors, (286), 14 states have call predecessors, (286), 14 states have return successors, (286), 282 states have call predecessors, (286), 286 states have call successors, (286) [2024-11-08 21:47:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2560 transitions. [2024-11-08 21:47:22,802 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2560 transitions. Word has length 208 [2024-11-08 21:47:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:22,803 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 2560 transitions. [2024-11-08 21:47:22,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:47:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2560 transitions. [2024-11-08 21:47:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 21:47:22,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:22,806 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:22,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 21:47:22,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:22,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash -277033380, now seen corresponding path program 1 times [2024-11-08 21:47:22,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:22,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480569458] [2024-11-08 21:47:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:22,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:47:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:23,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480569458] [2024-11-08 21:47:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480569458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:47:23,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407603378] [2024-11-08 21:47:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:23,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:23,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:23,118 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:47:23,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:47:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:23,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:47:23,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-08 21:47:23,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:47:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:47:23,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407603378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:47:23,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:47:23,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 21:47:23,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765192803] [2024-11-08 21:47:23,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:47:23,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 21:47:23,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:23,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 21:47:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:47:23,778 INFO L87 Difference]: Start difference. First operand 1644 states and 2560 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-08 21:47:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:24,116 INFO L93 Difference]: Finished difference Result 3258 states and 5034 transitions. [2024-11-08 21:47:24,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 21:47:24,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 208 [2024-11-08 21:47:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:24,129 INFO L225 Difference]: With dead ends: 3258 [2024-11-08 21:47:24,146 INFO L226 Difference]: Without dead ends: 1708 [2024-11-08 21:47:24,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:47:24,150 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 286 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:24,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 323 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:47:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2024-11-08 21:47:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1680. [2024-11-08 21:47:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1370 states have (on average 1.4124087591240877) internal successors, (1935), 1374 states have internal predecessors, (1935), 286 states have call successors, (286), 23 states have call predecessors, (286), 23 states have return successors, (286), 282 states have call predecessors, (286), 286 states have call successors, (286) [2024-11-08 21:47:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2507 transitions. [2024-11-08 21:47:24,275 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2507 transitions. Word has length 208 [2024-11-08 21:47:24,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:24,276 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2507 transitions. [2024-11-08 21:47:24,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-08 21:47:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2507 transitions. [2024-11-08 21:47:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 21:47:24,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:24,279 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:24,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:47:24,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 21:47:24,480 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:24,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash -693751886, now seen corresponding path program 1 times [2024-11-08 21:47:24,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:24,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737570476] [2024-11-08 21:47:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:24,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737570476] [2024-11-08 21:47:24,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737570476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:24,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:24,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:47:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345155503] [2024-11-08 21:47:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:24,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:47:24,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:24,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:47:24,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:47:24,637 INFO L87 Difference]: Start difference. First operand 1680 states and 2507 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:24,829 INFO L93 Difference]: Finished difference Result 4420 states and 6603 transitions. [2024-11-08 21:47:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:47:24,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 211 [2024-11-08 21:47:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:24,845 INFO L225 Difference]: With dead ends: 4420 [2024-11-08 21:47:24,845 INFO L226 Difference]: Without dead ends: 2870 [2024-11-08 21:47:24,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:47:24,851 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 107 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:24,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 376 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:47:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2024-11-08 21:47:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2860. [2024-11-08 21:47:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2354 states have (on average 1.397196261682243) internal successors, (3289), 2370 states have internal predecessors, (3289), 462 states have call successors, (462), 43 states have call predecessors, (462), 43 states have return successors, (462), 446 states have call predecessors, (462), 462 states have call successors, (462) [2024-11-08 21:47:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 4213 transitions. [2024-11-08 21:47:25,041 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 4213 transitions. Word has length 211 [2024-11-08 21:47:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:25,041 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 4213 transitions. [2024-11-08 21:47:25,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 4213 transitions. [2024-11-08 21:47:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 21:47:25,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:25,045 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:25,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 21:47:25,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:25,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash -271050060, now seen corresponding path program 1 times [2024-11-08 21:47:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674285786] [2024-11-08 21:47:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:47:25,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:25,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674285786] [2024-11-08 21:47:25,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674285786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:47:25,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373787370] [2024-11-08 21:47:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:25,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:25,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:25,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:47:25,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 21:47:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:25,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:47:25,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 789 proven. 27 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:47:25,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:47:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:47:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373787370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:47:25,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:47:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 21:47:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474858565] [2024-11-08 21:47:25,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:47:25,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 21:47:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:25,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 21:47:25,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:47:25,834 INFO L87 Difference]: Start difference. First operand 2860 states and 4213 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2024-11-08 21:47:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:26,144 INFO L93 Difference]: Finished difference Result 4290 states and 6319 transitions. [2024-11-08 21:47:26,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 21:47:26,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 211 [2024-11-08 21:47:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:26,155 INFO L225 Difference]: With dead ends: 4290 [2024-11-08 21:47:26,155 INFO L226 Difference]: Without dead ends: 1744 [2024-11-08 21:47:26,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:47:26,162 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 279 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:26,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 311 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:47:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2024-11-08 21:47:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1716. [2024-11-08 21:47:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1397 states have (on average 1.3500357909806728) internal successors, (1886), 1401 states have internal predecessors, (1886), 286 states have call successors, (286), 32 states have call predecessors, (286), 32 states have return successors, (286), 282 states have call predecessors, (286), 286 states have call successors, (286) [2024-11-08 21:47:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2458 transitions. [2024-11-08 21:47:26,323 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2458 transitions. Word has length 211 [2024-11-08 21:47:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:26,324 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2458 transitions. [2024-11-08 21:47:26,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2024-11-08 21:47:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2458 transitions. [2024-11-08 21:47:26,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 21:47:26,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:26,327 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:26,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:47:26,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 21:47:26,531 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:26,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2070300723, now seen corresponding path program 1 times [2024-11-08 21:47:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:26,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683182058] [2024-11-08 21:47:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:47:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:47:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:47:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:47:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:47:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:47:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:47:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:47:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:47:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:47:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:47:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:47:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:47:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:47:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:47:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:47:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:47:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683182058] [2024-11-08 21:47:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683182058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:26,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:26,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:47:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670870874] [2024-11-08 21:47:26,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:26,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:47:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:47:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:47:26,706 INFO L87 Difference]: Start difference. First operand 1716 states and 2458 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:26,874 INFO L93 Difference]: Finished difference Result 3346 states and 4813 transitions. [2024-11-08 21:47:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:47:26,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 213 [2024-11-08 21:47:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:26,884 INFO L225 Difference]: With dead ends: 3346 [2024-11-08 21:47:26,885 INFO L226 Difference]: Without dead ends: 1736 [2024-11-08 21:47:26,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:47:26,889 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 3 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:26,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 458 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:47:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2024-11-08 21:47:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1736. [2024-11-08 21:47:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1417 states have (on average 1.3450952717007763) internal successors, (1906), 1421 states have internal predecessors, (1906), 286 states have call successors, (286), 32 states have call predecessors, (286), 32 states have return successors, (286), 282 states have call predecessors, (286), 286 states have call successors, (286) [2024-11-08 21:47:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2478 transitions. [2024-11-08 21:47:27,027 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2478 transitions. Word has length 213 [2024-11-08 21:47:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:27,027 INFO L471 AbstractCegarLoop]: Abstraction has 1736 states and 2478 transitions. [2024-11-08 21:47:27,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2478 transitions. [2024-11-08 21:47:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 21:47:27,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:27,030 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:27,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 21:47:27,031 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:27,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:27,031 INFO L85 PathProgramCache]: Analyzing trace with hash -147072689, now seen corresponding path program 1 times [2024-11-08 21:47:27,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991806864] [2024-11-08 21:47:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:27,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:47:27,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473007222] [2024-11-08 21:47:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:27,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:27,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:27,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:47:27,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 21:47:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:47:27,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:47:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:47:27,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:47:27,587 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:47:27,588 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:47:27,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 21:47:27,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:27,794 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:27,941 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:47:27,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:47:27 BoogieIcfgContainer [2024-11-08 21:47:27,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:47:27,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:47:27,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:47:27,946 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:47:27,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:15" (3/4) ... [2024-11-08 21:47:27,949 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:47:27,950 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:47:27,950 INFO L158 Benchmark]: Toolchain (without parser) took 14302.95ms. Allocated memory was 132.1MB in the beginning and 398.5MB in the end (delta: 266.3MB). Free memory was 78.3MB in the beginning and 164.3MB in the end (delta: -86.0MB). Peak memory consumption was 182.7MB. Max. memory is 16.1GB. [2024-11-08 21:47:27,950 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 132.1MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:47:27,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.19ms. Allocated memory is still 132.1MB. Free memory was 78.0MB in the beginning and 58.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 21:47:27,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.94ms. Allocated memory is still 132.1MB. Free memory was 58.3MB in the beginning and 97.4MB in the end (delta: -39.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-11-08 21:47:27,952 INFO L158 Benchmark]: Boogie Preprocessor took 110.71ms. Allocated memory is still 132.1MB. Free memory was 97.4MB in the beginning and 84.8MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 21:47:27,952 INFO L158 Benchmark]: RCFGBuilder took 712.96ms. Allocated memory is still 132.1MB. Free memory was 84.8MB in the beginning and 42.3MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-08 21:47:27,952 INFO L158 Benchmark]: TraceAbstraction took 12885.10ms. Allocated memory was 184.5MB in the beginning and 398.5MB in the end (delta: 213.9MB). Free memory was 151.5MB in the beginning and 165.3MB in the end (delta: -13.8MB). Peak memory consumption was 199.0MB. Max. memory is 16.1GB. [2024-11-08 21:47:27,953 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 398.5MB. Free memory was 165.3MB in the beginning and 164.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:47:27,954 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.20ms. Allocated memory is still 132.1MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.19ms. Allocated memory is still 132.1MB. Free memory was 78.0MB in the beginning and 58.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.94ms. Allocated memory is still 132.1MB. Free memory was 58.3MB in the beginning and 97.4MB in the end (delta: -39.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.71ms. Allocated memory is still 132.1MB. Free memory was 97.4MB in the beginning and 84.8MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 712.96ms. Allocated memory is still 132.1MB. Free memory was 84.8MB in the beginning and 42.3MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12885.10ms. Allocated memory was 184.5MB in the beginning and 398.5MB in the end (delta: 213.9MB). Free memory was 151.5MB in the beginning and 165.3MB in the end (delta: -13.8MB). Peak memory consumption was 199.0MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 398.5MB. Free memory was 165.3MB in the beginning and 164.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of bitwiseOr at line 183, overapproximation of someBinaryArithmeticDOUBLEoperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned short int var_1_24 = 8; [L43] unsigned short int var_1_26 = 26914; [L44] unsigned short int var_1_27 = 26182; [L45] unsigned char var_1_28 = 5; [L46] unsigned char var_1_29 = 50; [L47] unsigned char var_1_30 = 10; [L48] signed long int var_1_31 = -32; [L49] unsigned char var_1_32 = 0; [L50] unsigned char var_1_33 = 1; [L51] unsigned char var_1_34 = 0; [L52] signed long int var_1_35 = 1000000; [L53] signed long int var_1_36 = 64; [L54] unsigned char last_1_var_1_3 = 64; [L55] unsigned short int last_1_var_1_6 = 10; [L56] unsigned short int last_1_var_1_15 = 5; [L57] unsigned short int last_1_var_1_20 = 50; [L58] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L176] last_1_var_1_3 = var_1_3 [L177] last_1_var_1_6 = var_1_6 [L178] last_1_var_1_15 = var_1_15 [L179] last_1_var_1_20 = var_1_20 [L180] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L190] RET updateLastVariables() [L191] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L128] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] var_1_5 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] var_1_9 = __VERIFIER_nondet_long() [L134] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L134] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L135] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L135] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L136] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L136] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L137] var_1_10 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L138] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L139] var_1_11 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_11 >= 0.0F && 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_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L140] RET assume_abort_if_not((var_1_11 >= 0.0F && 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_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L141] var_1_12 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_12 >= 0.0F && 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_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L142] RET assume_abort_if_not((var_1_12 >= 0.0F && 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_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L143] var_1_13 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L144] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L145] var_1_14 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L146] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L147] var_1_17 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L148] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L149] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L149] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L150] var_1_18 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L151] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L152] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L152] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L153] var_1_19 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L154] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L155] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L155] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L156] var_1_26 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_26 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L157] RET assume_abort_if_not(var_1_26 >= 16383) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L158] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L158] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L159] var_1_27 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_27 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L160] RET assume_abort_if_not(var_1_27 >= 16384) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L161] CALL assume_abort_if_not(var_1_27 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L161] RET assume_abort_if_not(var_1_27 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L162] var_1_29 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L163] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L164] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L164] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L165] var_1_30 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L166] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L167] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L167] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L168] var_1_33 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_33 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L169] RET assume_abort_if_not(var_1_33 >= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L170] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L170] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L171] var_1_34 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L173] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L173] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L191] RET updateVariables() [L192] CALL step() [L62] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L63] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L66] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L66] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L67] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=244, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L68] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=244, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L71] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L75] COND FALSE !(((((var_1_21) < (var_1_5)) ? (var_1_21) : (var_1_5))) >= var_1_9) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L78] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L79] COND TRUE var_1_26 > 100 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L80] EXPR ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L80] COND FALSE !((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_4) [L83] var_1_32 = var_1_34 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_8=15/8, var_1_9=245] [L86] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L87] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L93] var_1_35 = ((((var_1_26) > (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) ? (var_1_26) : (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))))) [L94] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L95] COND TRUE var_1_26 != 10 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L96] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L100] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L101] COND TRUE var_1_27 > 0 [L102] var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_4)) ? ((var_1_29 + var_1_30)) : (var_1_4)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_4)) ? ((var_1_29 + var_1_30)) : (var_1_4)))) : (0))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L104] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L105] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L105] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L108] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L109] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=498, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L111] var_1_22 = var_1_4 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=498, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=254, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L112] COND FALSE !(var_1_29 > var_1_30) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=498, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=254, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L119] COND FALSE !(var_1_3 >= var_1_4) [L122] var_1_36 = var_1_4 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=498, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=254, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=254, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L192] RET step() [L193] CALL, EXPR property() [L183] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=498, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=254, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=254, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L183] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=498, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=254, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=254, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L183] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=498, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=254, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=254, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L183] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=498, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=254, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=254, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L183-L184] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=498, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=254, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=254, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=498, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=254, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=256, var_1_33=1, var_1_34=256, var_1_35=16384, var_1_36=254, var_1_3=64, var_1_4=254, var_1_5=244, var_1_6=10, var_1_9=245] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 14, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2057 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2019 mSDsluCounter, 6080 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3888 mSDsCounter, 598 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1069 IncrementalHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 598 mSolverCounterUnsat, 2192 mSDtfsCounter, 1069 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1718 GetRequests, 1666 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2860occurred in iteration=11, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 603 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 3505 NumberOfCodeBlocks, 3505 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3481 ConstructedInterpolants, 0 QuantifiedInterpolants, 9030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 955 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 29400/29580 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:47:27,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f9bd018564099dceca052b7e7f37fc49b50d77146132d1697955eccca4510db --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:47:30,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:47:30,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:47:30,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:47:30,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:47:30,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:47:30,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:47:30,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:47:30,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:47:30,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:47:30,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:47:30,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:47:30,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:47:30,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:47:30,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:47:30,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:47:30,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:47:30,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:47:30,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:47:30,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:47:30,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:47:30,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:47:30,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:47:30,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:47:30,344 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:47:30,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:47:30,344 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:47:30,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:47:30,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:47:30,345 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:47:30,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:47:30,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:47:30,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:47:30,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:47:30,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:30,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:47:30,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:47:30,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:47:30,349 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:47:30,349 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:47:30,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:47:30,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:47:30,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:47:30,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:47:30,350 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f9bd018564099dceca052b7e7f37fc49b50d77146132d1697955eccca4510db [2024-11-08 21:47:30,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:47:30,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:47:30,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:47:30,701 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:47:30,701 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:47:30,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i [2024-11-08 21:47:32,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:47:32,519 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:47:32,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i [2024-11-08 21:47:32,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7b7de8a/b6aa1bcb6ec34397b86209cbfa68345e/FLAG6248fc693 [2024-11-08 21:47:32,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7b7de8a/b6aa1bcb6ec34397b86209cbfa68345e [2024-11-08 21:47:32,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:47:32,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:47:32,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:32,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:47:32,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:47:32,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:32" (1/1) ... [2024-11-08 21:47:32,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a8c3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:32, skipping insertion in model container [2024-11-08 21:47:32,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:32" (1/1) ... [2024-11-08 21:47:32,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:47:33,106 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i[919,932] [2024-11-08 21:47:33,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:33,204 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:47:33,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i[919,932] [2024-11-08 21:47:33,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:33,301 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:47:33,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33 WrapperNode [2024-11-08 21:47:33,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:33,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:33,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:47:33,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:47:33,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,368 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-08 21:47:33,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:33,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:47:33,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:47:33,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:47:33,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,425 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:47:33,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:47:33,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:47:33,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:47:33,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:47:33,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (1/1) ... [2024-11-08 21:47:33,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:33,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:33,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:47:33,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:47:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:47:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:47:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:47:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:47:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:47:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:47:33,678 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:47:33,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:47:40,243 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 21:47:40,244 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:47:40,257 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:47:40,258 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:47:40,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:40 BoogieIcfgContainer [2024-11-08 21:47:40,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:47:40,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:47:40,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:47:40,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:47:40,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:47:32" (1/3) ... [2024-11-08 21:47:40,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d093b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:40, skipping insertion in model container [2024-11-08 21:47:40,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:33" (2/3) ... [2024-11-08 21:47:40,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d093b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:40, skipping insertion in model container [2024-11-08 21:47:40,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:40" (3/3) ... [2024-11-08 21:47:40,269 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-78.i [2024-11-08 21:47:40,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:47:40,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:47:40,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:47:40,358 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;@49b1399e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:47:40,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:47:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:47:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 21:47:40,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:40,386 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:40,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:40,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 97598318, now seen corresponding path program 1 times [2024-11-08 21:47:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:47:40,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746980212] [2024-11-08 21:47:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:40,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:47:40,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:47:40,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:47:40,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 21:47:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:40,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:47:40,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2024-11-08 21:47:40,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:47:40,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:47:40,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746980212] [2024-11-08 21:47:40,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746980212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:40,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:40,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:47:40,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629402155] [2024-11-08 21:47:40,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:40,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:47:40,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:47:40,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:47:40,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:47:40,989 INFO L87 Difference]: Start difference. First operand has 88 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:47:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:41,022 INFO L93 Difference]: Finished difference Result 169 states and 296 transitions. [2024-11-08 21:47:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:47:41,024 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 193 [2024-11-08 21:47:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:41,030 INFO L225 Difference]: With dead ends: 169 [2024-11-08 21:47:41,030 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 21:47:41,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:47:41,036 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:41,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:47:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 21:47:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-08 21:47:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:47:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2024-11-08 21:47:41,078 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 193 [2024-11-08 21:47:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:41,078 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2024-11-08 21:47:41,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:47:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2024-11-08 21:47:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 21:47:41,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:41,083 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:41,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 21:47:41,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:47:41,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:41,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash -613409566, now seen corresponding path program 1 times [2024-11-08 21:47:41,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:47:41,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593515136] [2024-11-08 21:47:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:41,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:47:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:47:41,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:47:41,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 21:47:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:41,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:47:41,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:44,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:47:44,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:47:44,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593515136] [2024-11-08 21:47:44,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593515136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:44,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:44,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:47:44,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559098306] [2024-11-08 21:47:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:44,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:47:44,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:47:44,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:47:44,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:47:44,963 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:49,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:47:53,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:47:53,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:53,674 INFO L93 Difference]: Finished difference Result 271 states and 419 transitions. [2024-11-08 21:47:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:47:53,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2024-11-08 21:47:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:53,708 INFO L225 Difference]: With dead ends: 271 [2024-11-08 21:47:53,708 INFO L226 Difference]: Without dead ends: 190 [2024-11-08 21:47:53,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:47:53,710 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 108 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:53,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 484 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 100 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2024-11-08 21:47:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-08 21:47:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2024-11-08 21:47:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 100 states have (on average 1.33) internal successors, (133), 100 states have internal predecessors, (133), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:47:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 253 transitions. [2024-11-08 21:47:53,752 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 253 transitions. Word has length 193 [2024-11-08 21:47:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:53,754 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 253 transitions. [2024-11-08 21:47:53,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 253 transitions. [2024-11-08 21:47:53,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 21:47:53,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:53,760 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:53,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 21:47:53,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:47:53,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:53,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash -190707740, now seen corresponding path program 1 times [2024-11-08 21:47:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:47:53,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238654489] [2024-11-08 21:47:53,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:53,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:47:53,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:47:53,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:47:53,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 21:47:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:47:54,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:47:54,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:47:54,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:47:54,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238654489] [2024-11-08 21:47:54,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238654489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:54,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:54,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:47:54,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920563397] [2024-11-08 21:47:54,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:54,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:47:54,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:47:54,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:47:54,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:47:54,594 INFO L87 Difference]: Start difference. First operand 163 states and 253 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:58,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 21:47:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:58,617 INFO L93 Difference]: Finished difference Result 244 states and 379 transitions. [2024-11-08 21:47:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:47:58,662 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2024-11-08 21:47:58,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:58,664 INFO L225 Difference]: With dead ends: 244 [2024-11-08 21:47:58,664 INFO L226 Difference]: Without dead ends: 163 [2024-11-08 21:47:58,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:47:58,666 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:58,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 21:47:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-08 21:47:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-08 21:47:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:47:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 251 transitions. [2024-11-08 21:47:58,689 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 251 transitions. Word has length 193 [2024-11-08 21:47:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:58,690 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 251 transitions. [2024-11-08 21:47:58,690 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:47:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 251 transitions. [2024-11-08 21:47:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 21:47:58,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:58,693 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:58,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 21:47:58,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:47:58,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:58,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:58,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1761245170, now seen corresponding path program 1 times [2024-11-08 21:47:58,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:47:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497993529] [2024-11-08 21:47:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:58,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:47:58,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:47:58,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:47:58,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 21:47:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:59,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:47:59,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 60 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-11-08 21:48:00,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:48:01,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:01,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497993529] [2024-11-08 21:48:02,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497993529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:48:02,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:48:02,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-11-08 21:48:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195774114] [2024-11-08 21:48:02,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:48:02,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 21:48:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:02,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 21:48:02,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:48:02,008 INFO L87 Difference]: Start difference. First operand 163 states and 251 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-08 21:48:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:03,408 INFO L93 Difference]: Finished difference Result 343 states and 515 transitions. [2024-11-08 21:48:03,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 21:48:03,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 194 [2024-11-08 21:48:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:03,414 INFO L225 Difference]: With dead ends: 343 [2024-11-08 21:48:03,414 INFO L226 Difference]: Without dead ends: 183 [2024-11-08 21:48:03,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:48:03,418 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 116 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:03,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 202 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 21:48:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-08 21:48:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2024-11-08 21:48:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:48:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 257 transitions. [2024-11-08 21:48:03,465 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 257 transitions. Word has length 194 [2024-11-08 21:48:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:03,466 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 257 transitions. [2024-11-08 21:48:03,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-08 21:48:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 257 transitions. [2024-11-08 21:48:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 21:48:03,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:03,469 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:03,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 21:48:03,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:03,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:03,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash -781444618, now seen corresponding path program 1 times [2024-11-08 21:48:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:03,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740995126] [2024-11-08 21:48:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:03,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:03,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:03,674 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:48:03,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 21:48:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:48:04,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:48:07,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:48:07,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:07,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740995126] [2024-11-08 21:48:07,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740995126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:07,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:07,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:48:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633257534] [2024-11-08 21:48:07,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:07,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:48:07,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:48:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:48:07,432 INFO L87 Difference]: Start difference. First operand 179 states and 257 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:48:09,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:48:11,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:48:15,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:48:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:15,656 INFO L93 Difference]: Finished difference Result 270 states and 386 transitions. [2024-11-08 21:48:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:48:15,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-11-08 21:48:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:15,660 INFO L225 Difference]: With dead ends: 270 [2024-11-08 21:48:15,660 INFO L226 Difference]: Without dead ends: 181 [2024-11-08 21:48:15,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:48:15,661 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 23 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:15,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 275 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-08 21:48:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-08 21:48:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2024-11-08 21:48:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 112 states have internal predecessors, (136), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:48:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 256 transitions. [2024-11-08 21:48:15,684 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 256 transitions. Word has length 196 [2024-11-08 21:48:15,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:15,685 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 256 transitions. [2024-11-08 21:48:15,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:48:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 256 transitions. [2024-11-08 21:48:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 21:48:15,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:15,688 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:15,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 21:48:15,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:15,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:15,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:15,889 INFO L85 PathProgramCache]: Analyzing trace with hash -101386248, now seen corresponding path program 1 times [2024-11-08 21:48:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:15,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132302995] [2024-11-08 21:48:15,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:15,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:15,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:15,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:48:15,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 21:48:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:16,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:48:16,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:48:18,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:48:18,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132302995] [2024-11-08 21:48:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132302995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:18,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:18,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:48:18,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258622065] [2024-11-08 21:48:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:18,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:48:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:18,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:48:18,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:48:18,654 INFO L87 Difference]: Start difference. First operand 179 states and 256 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:48:21,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:48:26,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:48:28,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:48:33,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []