./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_fillercodesize_ps-cn-25_file-4.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 cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:18:56,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:18:56,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:18:56,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:18:56,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:18:56,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:18:56,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:18:56,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:18:56,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:18:56,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:18:56,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:18:56,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:18:56,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:18:56,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:18:56,339 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:18:56,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:18:56,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:18:56,340 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:18:56,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:18:56,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:18:56,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:18:56,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:18:56,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:18:56,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:18:56,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:18:56,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:18:56,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:18:56,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:18:56,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:18:56,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:18:56,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:18:56,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:18:56,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:18:56,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:18:56,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:18:56,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:18:56,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:18:56,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:18:56,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:18:56,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:18:56,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:18:56,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:18:56,349 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 -> cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 [2024-11-12 02:18:56,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:18:56,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:18:56,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:18:56,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:18:56,606 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:18:56,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-12 02:18:58,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:18:58,342 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:18:58,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-12 02:18:58,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc6bc3674/907095322fd94f11b6f497e710739cd9/FLAG2018fac19 [2024-11-12 02:18:58,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc6bc3674/907095322fd94f11b6f497e710739cd9 [2024-11-12 02:18:58,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:18:58,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:18:58,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:18:58,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:18:58,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:18:58,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:58" (1/1) ... [2024-11-12 02:18:58,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f801477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:58, skipping insertion in model container [2024-11-12 02:18:58,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:58" (1/1) ... [2024-11-12 02:18:58,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:18:58,885 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_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-12 02:18:58,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:18:58,952 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:18:58,962 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_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-12 02:18:58,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:18:59,006 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:18:59,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59 WrapperNode [2024-11-12 02:18:59,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:18:59,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:18:59,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:18:59,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:18:59,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,063 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-11-12 02:18:59,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:18:59,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:18:59,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:18:59,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:18:59,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,104 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-12 02:18:59,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:18:59,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:18:59,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:18:59,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:18:59,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (1/1) ... [2024-11-12 02:18:59,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:18:59,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:18:59,165 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-12 02:18:59,169 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-12 02:18:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:18:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:18:59,212 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:18:59,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:18:59,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:18:59,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:18:59,289 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:18:59,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:18:59,682 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 02:18:59,682 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:18:59,698 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:18:59,699 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:18:59,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:59 BoogieIcfgContainer [2024-11-12 02:18:59,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:18:59,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:18:59,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:18:59,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:18:59,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:18:58" (1/3) ... [2024-11-12 02:18:59,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd9af56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:59, skipping insertion in model container [2024-11-12 02:18:59,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:59" (2/3) ... [2024-11-12 02:18:59,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd9af56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:59, skipping insertion in model container [2024-11-12 02:18:59,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:59" (3/3) ... [2024-11-12 02:18:59,708 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-12 02:18:59,728 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:18:59,729 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:18:59,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:18:59,806 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;@5b143388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:18:59,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:18:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:18:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-12 02:18:59,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:18:59,829 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:18:59,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:18:59,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:18:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1292902638, now seen corresponding path program 1 times [2024-11-12 02:18:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:18:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184777911] [2024-11-12 02:18:59,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:18:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:19:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:19:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:19:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:19:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:19:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:19:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:19:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:19:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:19:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:19:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:19:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:19:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:19:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:19:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:19:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:19:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 02:19:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:19:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:19:00,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:00,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184777911] [2024-11-12 02:19:00,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184777911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:00,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:00,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:19:00,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657802740] [2024-11-12 02:19:00,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:00,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:19:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:00,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:19:00,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:19:00,443 INFO L87 Difference]: Start difference. First operand has 91 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:19:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:00,496 INFO L93 Difference]: Finished difference Result 175 states and 311 transitions. [2024-11-12 02:19:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:19:00,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2024-11-12 02:19:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:00,506 INFO L225 Difference]: With dead ends: 175 [2024-11-12 02:19:00,506 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 02:19:00,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-12 02:19:00,512 INFO L435 NwaCegarLoop]: 134 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, 134 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-12 02:19:00,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:19:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 02:19:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 02:19:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:19:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-12 02:19:00,550 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 207 [2024-11-12 02:19:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:00,550 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-12 02:19:00,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:19:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-12 02:19:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 02:19:00,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:00,554 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:00,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:19:00,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:00,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:00,555 INFO L85 PathProgramCache]: Analyzing trace with hash 983778013, now seen corresponding path program 1 times [2024-11-12 02:19:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365605485] [2024-11-12 02:19:00,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:19:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:19:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:19:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:19:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:19:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:19:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:19:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:19:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:19:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:19:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:19:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:19:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:19:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:19:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:19:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:19:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 02:19:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:19:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:19:01,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:01,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365605485] [2024-11-12 02:19:01,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365605485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:01,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:01,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:19:01,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254938898] [2024-11-12 02:19:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:01,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:19:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:19:01,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:19:01,617 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:01,715 INFO L93 Difference]: Finished difference Result 199 states and 300 transitions. [2024-11-12 02:19:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:19:01,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-12 02:19:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:01,722 INFO L225 Difference]: With dead ends: 199 [2024-11-12 02:19:01,723 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 02:19:01,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:19:01,728 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 39 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:01,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 263 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:19:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 02:19:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2024-11-12 02:19:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:19:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2024-11-12 02:19:01,748 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 208 [2024-11-12 02:19:01,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:01,751 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2024-11-12 02:19:01,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2024-11-12 02:19:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 02:19:01,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:01,755 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:01,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:19:01,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:01,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 985625055, now seen corresponding path program 1 times [2024-11-12 02:19:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:01,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297962609] [2024-11-12 02:19:01,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:01,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:19:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:19:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:19:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:19:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:19:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:19:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:19:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:19:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:19:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:19:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:19:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:19:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:19:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:19:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:19:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:19:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 02:19:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:19:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:19:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:02,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297962609] [2024-11-12 02:19:02,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297962609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:02,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:02,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:19:02,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272689020] [2024-11-12 02:19:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:02,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:19:02,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:02,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:19:02,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:19:02,332 INFO L87 Difference]: Start difference. First operand 97 states and 149 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-12 02:19:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:02,548 INFO L93 Difference]: Finished difference Result 263 states and 405 transitions. [2024-11-12 02:19:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:19:02,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 208 [2024-11-12 02:19:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:02,551 INFO L225 Difference]: With dead ends: 263 [2024-11-12 02:19:02,551 INFO L226 Difference]: Without dead ends: 169 [2024-11-12 02:19:02,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:19:02,553 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 207 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:02,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 238 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:19:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-12 02:19:02,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-11-12 02:19:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 111 states have internal predecessors, (150), 53 states have call successors, (53), 2 states have call predecessors, (53), 2 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-12 02:19:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 256 transitions. [2024-11-12 02:19:02,577 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 256 transitions. Word has length 208 [2024-11-12 02:19:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:02,579 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 256 transitions. [2024-11-12 02:19:02,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-12 02:19:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 256 transitions. [2024-11-12 02:19:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 02:19:02,584 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:02,584 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:02,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:19:02,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:02,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:02,585 INFO L85 PathProgramCache]: Analyzing trace with hash -602722847, now seen corresponding path program 1 times [2024-11-12 02:19:02,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:02,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866174616] [2024-11-12 02:19:02,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:19:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:19:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:19:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:19:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:19:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:19:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:19:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:19:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:19:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:19:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:19:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:19:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:19:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:19:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:19:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:19:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 02:19:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:19:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:19:06,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:06,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866174616] [2024-11-12 02:19:06,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866174616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:06,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:06,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 02:19:06,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291539189] [2024-11-12 02:19:06,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:06,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 02:19:06,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:06,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 02:19:06,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-12 02:19:06,720 INFO L87 Difference]: Start difference. First operand 166 states and 256 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:07,860 INFO L93 Difference]: Finished difference Result 484 states and 716 transitions. [2024-11-12 02:19:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 02:19:07,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-12 02:19:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:07,865 INFO L225 Difference]: With dead ends: 484 [2024-11-12 02:19:07,865 INFO L226 Difference]: Without dead ends: 321 [2024-11-12 02:19:07,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-11-12 02:19:07,867 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 122 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:07,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 688 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 02:19:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-12 02:19:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 244. [2024-11-12 02:19:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 182 states have (on average 1.3296703296703296) internal successors, (242), 185 states have internal predecessors, (242), 57 states have call successors, (57), 4 states have call predecessors, (57), 4 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-12 02:19:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 356 transitions. [2024-11-12 02:19:07,888 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 356 transitions. Word has length 208 [2024-11-12 02:19:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:07,888 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 356 transitions. [2024-11-12 02:19:07,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 356 transitions. [2024-11-12 02:19:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 02:19:07,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:07,891 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:07,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 02:19:07,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:07,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash -344557409, now seen corresponding path program 1 times [2024-11-12 02:19:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:07,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646640614] [2024-11-12 02:19:07,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:19:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:19:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:19:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:19:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:19:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:19:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:19:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:19:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:19:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:19:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:19:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:19:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:19:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:19:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:19:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:19:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 02:19:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:19:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:19:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646640614] [2024-11-12 02:19:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646640614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:08,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:08,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:19:08,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563076195] [2024-11-12 02:19:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:08,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:19:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:19:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:19:08,291 INFO L87 Difference]: Start difference. First operand 244 states and 356 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:08,403 INFO L93 Difference]: Finished difference Result 674 states and 994 transitions. [2024-11-12 02:19:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:19:08,404 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-12 02:19:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:08,410 INFO L225 Difference]: With dead ends: 674 [2024-11-12 02:19:08,411 INFO L226 Difference]: Without dead ends: 433 [2024-11-12 02:19:08,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:19:08,413 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 66 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:08,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 264 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:19:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-12 02:19:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 431. [2024-11-12 02:19:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 308 states have (on average 1.3246753246753247) internal successors, (408), 314 states have internal predecessors, (408), 114 states have call successors, (114), 8 states have call predecessors, (114), 8 states have return successors, (114), 108 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-12 02:19:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 636 transitions. [2024-11-12 02:19:08,489 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 636 transitions. Word has length 208 [2024-11-12 02:19:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:08,491 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 636 transitions. [2024-11-12 02:19:08,492 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 636 transitions. [2024-11-12 02:19:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-12 02:19:08,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:08,495 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:08,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 02:19:08,495 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:08,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash -486311048, now seen corresponding path program 1 times [2024-11-12 02:19:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:08,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295286900] [2024-11-12 02:19:08,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:19:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:19:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:19:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:19:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:19:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:19:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:19:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:19:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:19:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:19:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:19:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:19:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:19:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:19:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:19:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:19:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 02:19:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:19:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-12 02:19:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295286900] [2024-11-12 02:19:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295286900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:19:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833995739] [2024-11-12 02:19:08,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:19:08,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:19:08,812 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-12 02:19:08,813 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-12 02:19:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:08,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 02:19:08,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:19:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-11-12 02:19:09,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:19:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-12 02:19:09,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833995739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:19:09,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 02:19:09,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 02:19:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229237932] [2024-11-12 02:19:09,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 02:19:09,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 02:19:09,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:09,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 02:19:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:19:09,542 INFO L87 Difference]: Start difference. First operand 431 states and 636 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-12 02:19:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:09,745 INFO L93 Difference]: Finished difference Result 795 states and 1145 transitions. [2024-11-12 02:19:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 02:19:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 209 [2024-11-12 02:19:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:09,749 INFO L225 Difference]: With dead ends: 795 [2024-11-12 02:19:09,749 INFO L226 Difference]: Without dead ends: 367 [2024-11-12 02:19:09,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 480 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-12 02:19:09,750 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 107 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:09,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 200 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:19:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-12 02:19:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 343. [2024-11-12 02:19:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 224 states have (on average 1.2142857142857142) internal successors, (272), 226 states have internal predecessors, (272), 106 states have call successors, (106), 12 states have call predecessors, (106), 12 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-12 02:19:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 484 transitions. [2024-11-12 02:19:09,785 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 484 transitions. Word has length 209 [2024-11-12 02:19:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:09,786 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 484 transitions. [2024-11-12 02:19:09,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-12 02:19:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 484 transitions. [2024-11-12 02:19:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-12 02:19:09,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:09,788 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:09,803 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-12 02:19:09,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 02:19:09,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:09,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash -358480210, now seen corresponding path program 1 times [2024-11-12 02:19:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:09,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919313523] [2024-11-12 02:19:09,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:19:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:19:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:19:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:19:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:19:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:19:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:19:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:19:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:19:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:19:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:19:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:19:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:19:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:19:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:19:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:19:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 02:19:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:19:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:19:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919313523] [2024-11-12 02:19:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919313523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:19:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087005539] [2024-11-12 02:19:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:19:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:10,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:19:10,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:19:10,202 INFO L87 Difference]: Start difference. First operand 343 states and 484 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:10,400 INFO L93 Difference]: Finished difference Result 681 states and 960 transitions. [2024-11-12 02:19:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:19:10,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-12 02:19:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:10,403 INFO L225 Difference]: With dead ends: 681 [2024-11-12 02:19:10,404 INFO L226 Difference]: Without dead ends: 494 [2024-11-12 02:19:10,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:19:10,406 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 129 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:10,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 498 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:19:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-12 02:19:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2024-11-12 02:19:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 312 states have (on average 1.1987179487179487) internal successors, (374), 315 states have internal predecessors, (374), 159 states have call successors, (159), 18 states have call predecessors, (159), 18 states have return successors, (159), 156 states have call predecessors, (159), 159 states have call successors, (159) [2024-11-12 02:19:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 692 transitions. [2024-11-12 02:19:10,469 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 692 transitions. Word has length 209 [2024-11-12 02:19:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:10,469 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 692 transitions. [2024-11-12 02:19:10,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 692 transitions. [2024-11-12 02:19:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-12 02:19:10,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:10,487 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:10,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 02:19:10,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:10,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash 321578160, now seen corresponding path program 1 times [2024-11-12 02:19:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653093855] [2024-11-12 02:19:10,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:19:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:19:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:19:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:19:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:19:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:19:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:19:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:19:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:19:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:19:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:19:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:19:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:19:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:19:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:19:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:19:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 02:19:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:19:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-12 02:19:11,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:11,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653093855] [2024-11-12 02:19:11,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653093855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:19:11,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253738770] [2024-11-12 02:19:11,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:11,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:19:11,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:19:11,427 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-12 02:19:11,428 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-12 02:19:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:11,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-12 02:19:11,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:19:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 828 proven. 402 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2024-11-12 02:19:14,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:19:35,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253738770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:19:35,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:19:35,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 27 [2024-11-12 02:19:35,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26674888] [2024-11-12 02:19:35,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:19:35,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-12 02:19:35,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:35,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-12 02:19:35,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1236, Unknown=1, NotChecked=0, Total=1640 [2024-11-12 02:19:35,979 INFO L87 Difference]: Start difference. First operand 490 states and 692 transitions. Second operand has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 25 states have internal predecessors, (110), 8 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 8 states have call predecessors, (66), 8 states have call successors, (66) [2024-11-12 02:19:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:40,402 INFO L93 Difference]: Finished difference Result 988 states and 1305 transitions. [2024-11-12 02:19:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-12 02:19:40,403 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 25 states have internal predecessors, (110), 8 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 8 states have call predecessors, (66), 8 states have call successors, (66) Word has length 209 [2024-11-12 02:19:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:40,413 INFO L225 Difference]: With dead ends: 988 [2024-11-12 02:19:40,413 INFO L226 Difference]: Without dead ends: 654 [2024-11-12 02:19:40,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3814 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=2948, Invalid=9707, Unknown=1, NotChecked=0, Total=12656 [2024-11-12 02:19:40,418 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 628 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:40,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 788 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 02:19:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-12 02:19:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 477. [2024-11-12 02:19:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 314 states have (on average 1.1464968152866242) internal successors, (360), 318 states have internal predecessors, (360), 122 states have call successors, (122), 40 states have call predecessors, (122), 40 states have return successors, (122), 118 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-12 02:19:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 604 transitions. [2024-11-12 02:19:40,538 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 604 transitions. Word has length 209 [2024-11-12 02:19:40,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:40,539 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 604 transitions. [2024-11-12 02:19:40,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 25 states have internal predecessors, (110), 8 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 8 states have call predecessors, (66), 8 states have call successors, (66) [2024-11-12 02:19:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 604 transitions. [2024-11-12 02:19:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-12 02:19:40,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:40,541 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:40,558 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-12 02:19:40,745 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,SelfDestructingSolverStorable7 [2024-11-12 02:19:40,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:40,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash -267479089, now seen corresponding path program 1 times [2024-11-12 02:19:40,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:40,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843901702] [2024-11-12 02:19:40,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:19:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:19:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:19:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:19:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:19:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:19:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:19:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:19:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:19:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:19:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:19:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:19:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:19:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:19:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:19:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:19:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 02:19:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:19:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-12 02:19:41,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:41,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843901702] [2024-11-12 02:19:41,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843901702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:19:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134359672] [2024-11-12 02:19:41,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:19:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:19:41,105 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-12 02:19:41,109 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-12 02:19:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:41,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 02:19:41,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:19:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 158 proven. 93 refuted. 0 times theorem prover too weak. 1861 trivial. 0 not checked. [2024-11-12 02:19:41,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:19:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-12 02:19:41,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134359672] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:19:41,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 02:19:41,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-12 02:19:41,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046780698] [2024-11-12 02:19:41,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 02:19:41,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 02:19:41,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 02:19:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 02:19:41,938 INFO L87 Difference]: Start difference. First operand 477 states and 604 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-12 02:19:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:42,754 INFO L93 Difference]: Finished difference Result 1491 states and 1862 transitions. [2024-11-12 02:19:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 02:19:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 209 [2024-11-12 02:19:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:42,760 INFO L225 Difference]: With dead ends: 1491 [2024-11-12 02:19:42,760 INFO L226 Difference]: Without dead ends: 1017 [2024-11-12 02:19:42,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 476 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-11-12 02:19:42,764 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 147 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:42,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 734 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 02:19:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2024-11-12 02:19:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 684. [2024-11-12 02:19:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 452 states have (on average 1.1327433628318584) internal successors, (512), 457 states have internal predecessors, (512), 175 states have call successors, (175), 56 states have call predecessors, (175), 56 states have return successors, (175), 170 states have call predecessors, (175), 175 states have call successors, (175) [2024-11-12 02:19:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 862 transitions. [2024-11-12 02:19:42,873 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 862 transitions. Word has length 209 [2024-11-12 02:19:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:42,874 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 862 transitions. [2024-11-12 02:19:42,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-12 02:19:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 862 transitions. [2024-11-12 02:19:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-12 02:19:42,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:42,877 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:42,892 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-12 02:19:43,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:19:43,079 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:43,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash -265632047, now seen corresponding path program 1 times [2024-11-12 02:19:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:43,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275171378] [2024-11-12 02:19:43,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:19:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:19:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:19:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:19:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:19:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:19:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:19:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:19:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:19:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:19:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:19:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:19:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:19:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:19:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:19:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:19:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 02:19:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:19:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:19:43,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275171378] [2024-11-12 02:19:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275171378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:43,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:43,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:19:43,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743431922] [2024-11-12 02:19:43,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:43,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:19:43,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:43,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:19:43,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:19:43,218 INFO L87 Difference]: Start difference. First operand 684 states and 862 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:43,288 INFO L93 Difference]: Finished difference Result 1182 states and 1487 transitions. [2024-11-12 02:19:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:19:43,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-12 02:19:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:43,292 INFO L225 Difference]: With dead ends: 1182 [2024-11-12 02:19:43,293 INFO L226 Difference]: Without dead ends: 477 [2024-11-12 02:19:43,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-12 02:19:43,295 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:43,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:19:43,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-12 02:19:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-11-12 02:19:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 314 states have (on average 1.10828025477707) internal successors, (348), 318 states have internal predecessors, (348), 122 states have call successors, (122), 40 states have call predecessors, (122), 40 states have return successors, (122), 118 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-12 02:19:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 592 transitions. [2024-11-12 02:19:43,359 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 592 transitions. Word has length 209 [2024-11-12 02:19:43,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:43,360 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 592 transitions. [2024-11-12 02:19:43,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 592 transitions. [2024-11-12 02:19:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-12 02:19:43,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:43,361 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:43,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 02:19:43,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:43,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1501399998, now seen corresponding path program 1 times [2024-11-12 02:19:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:43,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094974520] [2024-11-12 02:19:43,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:43,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:19:43,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122970053] [2024-11-12 02:19:43,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:43,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:19:43,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:19:43,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 02:19:43,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 02:19:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:19:43,552 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 02:19:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:19:43,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 02:19:43,746 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 02:19:43,747 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 02:19:43,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 02:19:43,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:19:43,956 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:44,087 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 02:19:44,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:19:44 BoogieIcfgContainer [2024-11-12 02:19:44,090 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 02:19:44,090 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 02:19:44,090 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 02:19:44,091 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 02:19:44,091 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:59" (3/4) ... [2024-11-12 02:19:44,093 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 02:19:44,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 02:19:44,095 INFO L158 Benchmark]: Toolchain (without parser) took 45395.30ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 158.1MB in the beginning and 403.7MB in the end (delta: -245.6MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2024-11-12 02:19:44,095 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:19:44,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.87ms. Allocated memory is still 188.7MB. Free memory was 157.9MB in the beginning and 144.8MB in the end (delta: 13.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-12 02:19:44,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.36ms. Allocated memory is still 188.7MB. Free memory was 144.8MB in the beginning and 141.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:19:44,096 INFO L158 Benchmark]: Boogie Preprocessor took 59.72ms. Allocated memory is still 188.7MB. Free memory was 141.1MB in the beginning and 136.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:19:44,096 INFO L158 Benchmark]: RCFGBuilder took 571.44ms. Allocated memory is still 188.7MB. Free memory was 136.9MB in the beginning and 110.3MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 02:19:44,096 INFO L158 Benchmark]: TraceAbstraction took 44388.69ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 109.5MB in the beginning and 404.8MB in the end (delta: -295.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-12 02:19:44,096 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 490.7MB. Free memory is still 403.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:19:44,098 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.11ms. Allocated memory is still 138.4MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.87ms. Allocated memory is still 188.7MB. Free memory was 157.9MB in the beginning and 144.8MB in the end (delta: 13.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.36ms. Allocated memory is still 188.7MB. Free memory was 144.8MB in the beginning and 141.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.72ms. Allocated memory is still 188.7MB. Free memory was 141.1MB in the beginning and 136.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 571.44ms. Allocated memory is still 188.7MB. Free memory was 136.9MB in the beginning and 110.3MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 44388.69ms. Allocated memory was 188.7MB in the beginning and 490.7MB in the end (delta: 302.0MB). Free memory was 109.5MB in the beginning and 404.8MB in the end (delta: -295.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 490.7MB. Free memory is still 403.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryArithmeticDOUBLEoperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] float var_1_27 = 31.25; [L44] float var_1_28 = 2.95; [L45] signed char var_1_29 = 10; [L46] double var_1_30 = 0.5; [L47] unsigned char var_1_31 = 0; [L48] unsigned short int var_1_32 = 1; [L49] double var_1_33 = 3.2; [L50] unsigned char var_1_34 = 2; [L51] unsigned char var_1_35 = 4; [L52] signed long int var_1_36 = -256; [L53] unsigned short int var_1_37 = 64; [L54] unsigned short int var_1_38 = 16; [L55] unsigned short int last_1_var_1_6 = 4; [L56] unsigned short int last_1_var_1_9 = 4; [L57] unsigned long int last_1_var_1_14 = 500; [L58] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L190] isInitial = 1 [L191] FCALL initially() [L192] COND TRUE 1 [L193] CALL updateLastVariables() [L180] last_1_var_1_6 = var_1_6 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_14 = var_1_14 [L183] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] RET updateLastVariables() [L194] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_5=0, var_1_6=4, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L129] var_1_5 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L130] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_6=4, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L132] var_1_10 = __VERIFIER_nondet_ushort() [L133] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L133] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] var_1_12 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L136] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] var_1_13 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] var_1_15 = __VERIFIER_nondet_ulong() [L140] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L142] var_1_16 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L145] var_1_19 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] var_1_20 = __VERIFIER_nondet_short() [L149] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] var_1_21 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] var_1_22 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] var_1_24 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] var_1_27 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L161] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] var_1_31 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] var_1_32 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] CALL assume_abort_if_not(var_1_32 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] RET assume_abort_if_not(var_1_32 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] var_1_33 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] var_1_35 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L194] RET updateVariables() [L195] CALL step() [L62] var_1_23 = var_1_24 [L63] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] COND TRUE (- var_1_27) >= var_1_28 [L65] var_1_26 = ((((var_1_24) > (var_1_29)) ? (var_1_24) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L67] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L72] COND FALSE !(var_1_26 < var_1_24) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L75] COND FALSE !(var_1_34 != ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=16, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] var_1_37 = var_1_34 [L79] var_1_38 = var_1_35 [L80] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L81] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L87] COND TRUE last_1_var_1_14 >= stepLocal_3 [L88] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L90] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L91] COND TRUE (- var_1_14) > var_1_6 [L92] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] unsigned char stepLocal_2 = var_1_4; [L98] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] COND TRUE stepLocal_1 >= var_1_6 [L103] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L108] unsigned char stepLocal_5 = var_1_1; [L109] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L110] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L117] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L118] COND TRUE ! var_1_1 [L119] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L195] RET step() [L196] CALL, EXPR property() [L186-L187] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L196] RET, EXPR property() [L196] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1598 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1564 mSDsluCounter, 3928 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2473 mSDsCounter, 566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2529 IncrementalHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 566 mSolverCounterUnsat, 1455 mSDtfsCounter, 2529 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2075 GetRequests, 1908 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3904 ImplicationChecksByTransitivity, 21.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=684occurred in iteration=9, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 638 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 3131 NumberOfCodeBlocks, 3131 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3114 ConstructedInterpolants, 0 QuantifiedInterpolants, 15365 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1464 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 30666/31680 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-12 02:19:44,314 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-12 02:19:44,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.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 cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:19:46,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:19:46,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 02:19:46,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:19:46,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:19:46,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:19:46,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:19:46,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:19:46,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:19:46,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:19:46,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:19:46,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:19:46,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:19:46,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:19:46,332 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:19:46,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:19:46,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:19:46,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:19:46,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:19:46,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:19:46,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:19:46,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:19:46,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:19:46,338 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 02:19:46,338 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 02:19:46,338 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:19:46,338 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 02:19:46,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:19:46,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:19:46,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:19:46,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:19:46,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:19:46,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:19:46,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:19:46,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:19:46,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:19:46,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:19:46,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:19:46,340 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 02:19:46,340 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 02:19:46,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:19:46,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:19:46,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:19:46,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:19:46,343 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 -> cc702294ab762f82a4156ec02c3796a72ec39b54f7f827a72f56934681f39759 [2024-11-12 02:19:46,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:19:46,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:19:46,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:19:46,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:19:46,645 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:19:46,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-12 02:19:48,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:19:48,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:19:48,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-12 02:19:48,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f57e7e359/09c8b20bf7b642e5a682a1b930f0a116/FLAG5fa08c340 [2024-11-12 02:19:48,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f57e7e359/09c8b20bf7b642e5a682a1b930f0a116 [2024-11-12 02:19:48,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:19:48,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:19:48,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:19:48,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:19:48,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:19:48,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:48" (1/1) ... [2024-11-12 02:19:48,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb67181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:48, skipping insertion in model container [2024-11-12 02:19:48,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:48" (1/1) ... [2024-11-12 02:19:48,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:19:49,102 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_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-12 02:19:49,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:19:49,189 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:19:49,202 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_fillercodesize_ps-cn-25_file-4.i[914,927] [2024-11-12 02:19:49,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:19:49,271 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:19:49,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49 WrapperNode [2024-11-12 02:19:49,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:19:49,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:19:49,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:19:49,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:19:49,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,339 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-12 02:19:49,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:19:49,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:19:49,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:19:49,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:19:49,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,376 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-12 02:19:49,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:19:49,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:19:49,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:19:49,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:19:49,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (1/1) ... [2024-11-12 02:19:49,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:19:49,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:19:49,445 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-12 02:19:49,452 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-12 02:19:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:19:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 02:19:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:19:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:19:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:19:49,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:19:49,568 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:19:49,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:19:50,343 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 02:19:50,344 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:19:50,370 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:19:50,370 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:19:50,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:50 BoogieIcfgContainer [2024-11-12 02:19:50,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:19:50,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:19:50,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:19:50,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:19:50,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:19:48" (1/3) ... [2024-11-12 02:19:50,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4a9c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:50, skipping insertion in model container [2024-11-12 02:19:50,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:49" (2/3) ... [2024-11-12 02:19:50,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4a9c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:50, skipping insertion in model container [2024-11-12 02:19:50,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:50" (3/3) ... [2024-11-12 02:19:50,378 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-4.i [2024-11-12 02:19:50,392 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:19:50,392 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:19:50,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:19:50,467 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;@1a00852e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:19:50,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:19:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:19:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-12 02:19:50,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:50,490 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:50,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:50,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1292902638, now seen corresponding path program 1 times [2024-11-12 02:19:50,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:19:50,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542245868] [2024-11-12 02:19:50,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:50,515 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-12 02:19:50,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:19:50,516 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-12 02:19:50,518 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-12 02:19:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:50,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 02:19:50,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:19:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 688 proven. 0 refuted. 0 times theorem prover too weak. 1424 trivial. 0 not checked. [2024-11-12 02:19:50,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:19:50,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:19:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542245868] [2024-11-12 02:19:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542245868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:50,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:50,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:19:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321520791] [2024-11-12 02:19:50,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:50,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:19:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:19:50,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:19:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:19:50,902 INFO L87 Difference]: Start difference. First operand has 91 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:19:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:50,939 INFO L93 Difference]: Finished difference Result 175 states and 311 transitions. [2024-11-12 02:19:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:19:50,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2024-11-12 02:19:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:50,951 INFO L225 Difference]: With dead ends: 175 [2024-11-12 02:19:50,951 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 02:19:50,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 206 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-12 02:19:50,959 INFO L435 NwaCegarLoop]: 134 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, 134 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-12 02:19:50,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:19:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 02:19:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 02:19:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:19:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-12 02:19:51,006 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 207 [2024-11-12 02:19:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:51,006 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-12 02:19:51,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:19:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-12 02:19:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 02:19:51,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:51,010 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:51,021 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-12 02:19:51,211 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-12 02:19:51,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:51,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash 983778013, now seen corresponding path program 1 times [2024-11-12 02:19:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:19:51,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36865115] [2024-11-12 02:19:51,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:51,213 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-12 02:19:51,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:19:51,216 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-12 02:19:51,216 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-12 02:19:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:51,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 02:19:51,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:19:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 309 proven. 177 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-11-12 02:19:52,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:19:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 180 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2024-11-12 02:19:52,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:19:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36865115] [2024-11-12 02:19:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36865115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:19:52,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:19:52,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-12 02:19:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971399356] [2024-11-12 02:19:52,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:19:52,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 02:19:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:19:52,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 02:19:52,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-12 02:19:52,978 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-12 02:19:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:53,958 INFO L93 Difference]: Finished difference Result 197 states and 290 transitions. [2024-11-12 02:19:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 02:19:53,958 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 208 [2024-11-12 02:19:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:53,961 INFO L225 Difference]: With dead ends: 197 [2024-11-12 02:19:53,962 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 02:19:53,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-12 02:19:53,963 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:53,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 319 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 02:19:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 02:19:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2024-11-12 02:19:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:19:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-11-12 02:19:53,982 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 208 [2024-11-12 02:19:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:53,986 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-11-12 02:19:53,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-12 02:19:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-11-12 02:19:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-12 02:19:53,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:53,992 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:54,009 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-12 02:19:54,193 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-12 02:19:54,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:54,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1635664496, now seen corresponding path program 1 times [2024-11-12 02:19:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:19:54,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331032973] [2024-11-12 02:19:54,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:54,196 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-12 02:19:54,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:19:54,197 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-12 02:19:54,202 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-12 02:19:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:54,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 02:19:54,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:19:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:19:54,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:19:54,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:19:54,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331032973] [2024-11-12 02:19:54,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331032973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:54,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:54,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:19:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727396028] [2024-11-12 02:19:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:54,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:19:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:19:54,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:19:54,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:19:54,808 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:55,877 INFO L93 Difference]: Finished difference Result 284 states and 404 transitions. [2024-11-12 02:19:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:19:55,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-12 02:19:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:55,881 INFO L225 Difference]: With dead ends: 284 [2024-11-12 02:19:55,883 INFO L226 Difference]: Without dead ends: 188 [2024-11-12 02:19:55,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:19:55,885 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 143 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:55,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 359 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 02:19:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-12 02:19:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2024-11-12 02:19:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 113 states have (on average 1.168141592920354) internal successors, (132), 113 states have internal predecessors, (132), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-12 02:19:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2024-11-12 02:19:55,906 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 209 [2024-11-12 02:19:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:55,906 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2024-11-12 02:19:55,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:19:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2024-11-12 02:19:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-12 02:19:55,908 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:55,909 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:19:55,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 02:19:56,109 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-12 02:19:56,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:56,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1979244430, now seen corresponding path program 1 times [2024-11-12 02:19:56,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:19:56,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994495964] [2024-11-12 02:19:56,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:56,111 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-12 02:19:56,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:19:56,114 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-12 02:19:56,115 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-12 02:19:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:56,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 02:19:56,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:19:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 816 proven. 72 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2024-11-12 02:19:57,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:19:57,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:19:57,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994495964] [2024-11-12 02:19:57,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994495964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:19:57,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1339354699] [2024-11-12 02:19:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:57,832 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 02:19:57,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 02:19:57,834 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 02:19:57,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-12 02:19:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:58,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 02:19:58,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:20:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 932 proven. 135 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2024-11-12 02:20:00,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:20:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1339354699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:20:00,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:20:00,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-11-12 02:20:00,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368387437] [2024-11-12 02:20:00,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:20:00,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 02:20:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:20:00,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 02:20:00,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-12 02:20:00,647 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 16 states have internal predecessors, (101), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2024-11-12 02:20:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:20:04,743 INFO L93 Difference]: Finished difference Result 501 states and 690 transitions. [2024-11-12 02:20:04,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 02:20:04,744 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 16 states have internal predecessors, (101), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) Word has length 209 [2024-11-12 02:20:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:20:04,749 INFO L225 Difference]: With dead ends: 501 [2024-11-12 02:20:04,749 INFO L226 Difference]: Without dead ends: 318 [2024-11-12 02:20:04,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-11-12 02:20:04,751 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 264 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-12 02:20:04,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 580 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-12 02:20:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-12 02:20:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 298. [2024-11-12 02:20:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 183 states have (on average 1.1475409836065573) internal successors, (210), 183 states have internal predecessors, (210), 99 states have call successors, (99), 15 states have call predecessors, (99), 15 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-12 02:20:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 408 transitions. [2024-11-12 02:20:04,810 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 408 transitions. Word has length 209 [2024-11-12 02:20:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:20:04,810 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 408 transitions. [2024-11-12 02:20:04,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 16 states have internal predecessors, (101), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2024-11-12 02:20:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 408 transitions. [2024-11-12 02:20:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-12 02:20:04,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:20:04,814 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:20:04,826 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-12 02:20:05,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-12 02:20:05,218 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 02:20:05,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:20:05,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:20:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1728916852, now seen corresponding path program 1 times [2024-11-12 02:20:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:20:05,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668420940] [2024-11-12 02:20:05,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:20:05,220 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-12 02:20:05,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:20:05,222 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-12 02:20:05,228 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-12 02:20:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:20:05,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 02:20:05,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:20:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:20:06,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:20:06,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:20:06,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668420940] [2024-11-12 02:20:06,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668420940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:20:06,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:20:06,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:20:06,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312980506] [2024-11-12 02:20:06,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:20:06,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:20:06,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:20:06,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:20:06,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:20:06,355 INFO L87 Difference]: Start difference. First operand 298 states and 408 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:20:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:20:07,164 INFO L93 Difference]: Finished difference Result 495 states and 675 transitions. [2024-11-12 02:20:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:20:07,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-12 02:20:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:20:07,178 INFO L225 Difference]: With dead ends: 495 [2024-11-12 02:20:07,178 INFO L226 Difference]: Without dead ends: 200 [2024-11-12 02:20:07,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:20:07,180 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 63 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 02:20:07,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 396 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 02:20:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-12 02:20:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 184. [2024-11-12 02:20:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 107 states have (on average 1.1214953271028036) internal successors, (120), 107 states have internal predecessors, (120), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-12 02:20:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 252 transitions. [2024-11-12 02:20:07,224 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 252 transitions. Word has length 209 [2024-11-12 02:20:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:20:07,225 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 252 transitions. [2024-11-12 02:20:07,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:20:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 252 transitions. [2024-11-12 02:20:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-12 02:20:07,227 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:20:07,227 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:20:07,243 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 (7)] Forceful destruction successful, exit code 0 [2024-11-12 02:20:07,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:20:07,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:20:07,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:20:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1104623556, now seen corresponding path program 1 times [2024-11-12 02:20:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:20:07,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523348392] [2024-11-12 02:20:07,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:20:07,430 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-12 02:20:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:20:07,433 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:20:07,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 02:20:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:20:07,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 02:20:07,661 INFO L279 TraceCheckSpWp]: Computing forward predicates...