./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_loopvsstraightlinecode_100-1loop_file-11.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 61d8b31ff1e9b7ded83368278938f158cc1aa40ff57fbd8a739b93a1e5cab26f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:18:33,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:18:33,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:18:33,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:18:33,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:18:33,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:18:33,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:18:33,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:18:33,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:18:33,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:18:33,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:18:33,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:18:33,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:18:33,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:18:33,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:18:33,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:18:33,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:18:33,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:18:33,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:18:33,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:18:33,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:18:33,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:18:33,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:18:33,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:18:33,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:18:33,408 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:18:33,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:18:33,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:18:33,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:18:33,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:18:33,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:18:33,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:18:33,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:18:33,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:18:33,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:18:33,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:18:33,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:18:33,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:18:33,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:18:33,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:18:33,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:18:33,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:18:33,413 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 -> 61d8b31ff1e9b7ded83368278938f158cc1aa40ff57fbd8a739b93a1e5cab26f [2024-11-18 22:18:33,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:18:33,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:18:33,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:18:33,650 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:18:33,651 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:18:33,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-18 22:18:35,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:18:35,276 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:18:35,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-18 22:18:35,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28da3b157/1faf6a42fb3e485a8d7a662340f2635c/FLAG20fab6e97 [2024-11-18 22:18:35,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28da3b157/1faf6a42fb3e485a8d7a662340f2635c [2024-11-18 22:18:35,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:18:35,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:18:35,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:18:35,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:18:35,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:18:35,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:35,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6e6aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35, skipping insertion in model container [2024-11-18 22:18:35,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:35,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:18:35,577 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_loopvsstraightlinecode_100-1loop_file-11.i[916,929] [2024-11-18 22:18:35,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:18:35,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:18:35,709 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_loopvsstraightlinecode_100-1loop_file-11.i[916,929] [2024-11-18 22:18:35,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:18:35,806 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:18:35,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35 WrapperNode [2024-11-18 22:18:35,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:18:35,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:18:35,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:18:35,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:18:35,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:35,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:35,939 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 297 [2024-11-18 22:18:35,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:18:35,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:18:35,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:18:35,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:18:35,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:35,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:35,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:36,016 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-18 22:18:36,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:36,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:36,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:36,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:36,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:36,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:36,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:18:36,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:18:36,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:18:36,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:18:36,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (1/1) ... [2024-11-18 22:18:36,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:18:36,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:36,085 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-18 22:18:36,088 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-18 22:18:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:18:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:18:36,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:18:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:18:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:18:36,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:18:36,182 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:18:36,184 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:18:36,667 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-18 22:18:36,668 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:18:36,679 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:18:36,680 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:18:36,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:36 BoogieIcfgContainer [2024-11-18 22:18:36,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:18:36,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:18:36,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:18:36,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:18:36,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:18:35" (1/3) ... [2024-11-18 22:18:36,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521e02a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:18:36, skipping insertion in model container [2024-11-18 22:18:36,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:35" (2/3) ... [2024-11-18 22:18:36,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521e02a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:18:36, skipping insertion in model container [2024-11-18 22:18:36,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:36" (3/3) ... [2024-11-18 22:18:36,686 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-18 22:18:36,701 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:18:36,702 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:18:36,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:18:36,768 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;@76a60767, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:18:36,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:18:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 93 states have (on average 1.5053763440860215) internal successors, (140), 94 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 22:18:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-18 22:18:36,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:36,790 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:36,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:36,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash 299585983, now seen corresponding path program 1 times [2024-11-18 22:18:36,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:36,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337651409] [2024-11-18 22:18:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-18 22:18:37,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:37,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337651409] [2024-11-18 22:18:37,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337651409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:18:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081306942] [2024-11-18 22:18:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:37,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:37,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:37,137 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-18 22:18:37,138 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-18 22:18:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:37,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:18:37,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-18 22:18:37,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:18:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081306942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:37,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:18:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:18:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953133432] [2024-11-18 22:18:37,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:37,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:18:37,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:37,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:18:37,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:18:37,371 INFO L87 Difference]: Start difference. First operand has 116 states, 93 states have (on average 1.5053763440860215) internal successors, (140), 94 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-18 22:18:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:37,437 INFO L93 Difference]: Finished difference Result 229 states and 377 transitions. [2024-11-18 22:18:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:18:37,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2024-11-18 22:18:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:37,446 INFO L225 Difference]: With dead ends: 229 [2024-11-18 22:18:37,446 INFO L226 Difference]: Without dead ends: 112 [2024-11-18 22:18:37,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-18 22:18:37,451 INFO L432 NwaCegarLoop]: 177 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, 177 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-18 22:18:37,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:18:37,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-18 22:18:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-18 22:18:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 90 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 22:18:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2024-11-18 22:18:37,494 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 148 [2024-11-18 22:18:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:37,494 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2024-11-18 22:18:37,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-18 22:18:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2024-11-18 22:18:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-18 22:18:37,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:37,497 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:37,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 22:18:37,698 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,SelfDestructingSolverStorable0 [2024-11-18 22:18:37,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:37,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash 79274551, now seen corresponding path program 1 times [2024-11-18 22:18:37,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:37,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812599508] [2024-11-18 22:18:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:18:38,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:38,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812599508] [2024-11-18 22:18:38,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812599508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:38,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:38,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:18:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366940110] [2024-11-18 22:18:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:38,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:38,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:38,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:38,025 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:38,058 INFO L93 Difference]: Finished difference Result 222 states and 345 transitions. [2024-11-18 22:18:38,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:18:38,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-11-18 22:18:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:38,060 INFO L225 Difference]: With dead ends: 222 [2024-11-18 22:18:38,060 INFO L226 Difference]: Without dead ends: 113 [2024-11-18 22:18:38,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:38,065 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 4 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:38,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 499 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:18:38,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-18 22:18:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-18 22:18:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 22:18:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 174 transitions. [2024-11-18 22:18:38,077 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 174 transitions. Word has length 148 [2024-11-18 22:18:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:38,078 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 174 transitions. [2024-11-18 22:18:38,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 174 transitions. [2024-11-18 22:18:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-18 22:18:38,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:38,081 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:38,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:18:38,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:38,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1115631110, now seen corresponding path program 1 times [2024-11-18 22:18:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:38,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447550900] [2024-11-18 22:18:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:18:38,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:38,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447550900] [2024-11-18 22:18:38,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447550900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:38,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:38,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 22:18:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861949760] [2024-11-18 22:18:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:38,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 22:18:38,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:38,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 22:18:38,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:18:38,562 INFO L87 Difference]: Start difference. First operand 113 states and 174 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:38,846 INFO L93 Difference]: Finished difference Result 481 states and 739 transitions. [2024-11-18 22:18:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 22:18:38,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2024-11-18 22:18:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:38,851 INFO L225 Difference]: With dead ends: 481 [2024-11-18 22:18:38,851 INFO L226 Difference]: Without dead ends: 371 [2024-11-18 22:18:38,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 22:18:38,853 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 530 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:38,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 694 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:18:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-18 22:18:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 223. [2024-11-18 22:18:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-18 22:18:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 347 transitions. [2024-11-18 22:18:38,898 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 347 transitions. Word has length 149 [2024-11-18 22:18:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:38,898 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 347 transitions. [2024-11-18 22:18:38,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 347 transitions. [2024-11-18 22:18:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-18 22:18:38,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:38,905 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:38,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:18:38,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:38,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 807596924, now seen corresponding path program 1 times [2024-11-18 22:18:38,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:38,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796434581] [2024-11-18 22:18:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:38,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:18:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:39,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796434581] [2024-11-18 22:18:39,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796434581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:39,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:39,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:18:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305276895] [2024-11-18 22:18:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:39,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:39,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:39,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:39,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:39,226 INFO L87 Difference]: Start difference. First operand 223 states and 347 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:39,383 INFO L93 Difference]: Finished difference Result 596 states and 927 transitions. [2024-11-18 22:18:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:18:39,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2024-11-18 22:18:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:39,386 INFO L225 Difference]: With dead ends: 596 [2024-11-18 22:18:39,386 INFO L226 Difference]: Without dead ends: 375 [2024-11-18 22:18:39,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-18 22:18:39,388 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 142 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:39,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 486 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:18:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-18 22:18:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 273. [2024-11-18 22:18:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 209 states have (on average 1.4545454545454546) internal successors, (304), 209 states have internal predecessors, (304), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-18 22:18:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 424 transitions. [2024-11-18 22:18:39,413 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 424 transitions. Word has length 149 [2024-11-18 22:18:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:39,413 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 424 transitions. [2024-11-18 22:18:39,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 424 transitions. [2024-11-18 22:18:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-18 22:18:39,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:39,415 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:39,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 22:18:39,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:39,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash -552455556, now seen corresponding path program 1 times [2024-11-18 22:18:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:39,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826872006] [2024-11-18 22:18:39,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:18:39,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826872006] [2024-11-18 22:18:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826872006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:39,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:39,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 22:18:39,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846670217] [2024-11-18 22:18:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:39,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 22:18:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:39,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 22:18:39,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:18:39,723 INFO L87 Difference]: Start difference. First operand 273 states and 424 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:40,076 INFO L93 Difference]: Finished difference Result 1113 states and 1727 transitions. [2024-11-18 22:18:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 22:18:40,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2024-11-18 22:18:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:40,084 INFO L225 Difference]: With dead ends: 1113 [2024-11-18 22:18:40,084 INFO L226 Difference]: Without dead ends: 893 [2024-11-18 22:18:40,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 22:18:40,087 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 593 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:40,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 705 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:18:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-11-18 22:18:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 619. [2024-11-18 22:18:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 513 states have (on average 1.510721247563353) internal successors, (775), 513 states have internal predecessors, (775), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-18 22:18:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 975 transitions. [2024-11-18 22:18:40,144 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 975 transitions. Word has length 149 [2024-11-18 22:18:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:40,146 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 975 transitions. [2024-11-18 22:18:40,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 975 transitions. [2024-11-18 22:18:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 22:18:40,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:40,148 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:40,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 22:18:40,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:40,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash 67409741, now seen corresponding path program 1 times [2024-11-18 22:18:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662674674] [2024-11-18 22:18:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:18:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:40,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662674674] [2024-11-18 22:18:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662674674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:40,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:40,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 22:18:40,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951086606] [2024-11-18 22:18:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:40,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 22:18:40,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:40,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 22:18:40,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 22:18:40,446 INFO L87 Difference]: Start difference. First operand 619 states and 975 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:40,674 INFO L93 Difference]: Finished difference Result 1473 states and 2320 transitions. [2024-11-18 22:18:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 22:18:40,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-18 22:18:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:40,680 INFO L225 Difference]: With dead ends: 1473 [2024-11-18 22:18:40,680 INFO L226 Difference]: Without dead ends: 907 [2024-11-18 22:18:40,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-18 22:18:40,683 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 175 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:40,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 696 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:18:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-18 22:18:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 629. [2024-11-18 22:18:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 523 states have (on average 1.5124282982791586) internal successors, (791), 523 states have internal predecessors, (791), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-18 22:18:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 991 transitions. [2024-11-18 22:18:40,741 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 991 transitions. Word has length 150 [2024-11-18 22:18:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:40,742 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 991 transitions. [2024-11-18 22:18:40,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 991 transitions. [2024-11-18 22:18:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 22:18:40,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:40,743 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:40,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 22:18:40,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:40,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash 18487713, now seen corresponding path program 1 times [2024-11-18 22:18:40,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:40,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604176036] [2024-11-18 22:18:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:40,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:18:41,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:41,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604176036] [2024-11-18 22:18:41,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604176036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:41,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:41,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:18:41,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332156656] [2024-11-18 22:18:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:41,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:41,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:41,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:41,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:41,115 INFO L87 Difference]: Start difference. First operand 629 states and 991 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:41,351 INFO L93 Difference]: Finished difference Result 1804 states and 2842 transitions. [2024-11-18 22:18:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:18:41,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-18 22:18:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:41,358 INFO L225 Difference]: With dead ends: 1804 [2024-11-18 22:18:41,358 INFO L226 Difference]: Without dead ends: 1222 [2024-11-18 22:18:41,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-18 22:18:41,360 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 256 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:41,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 524 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:18:41,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-11-18 22:18:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1066. [2024-11-18 22:18:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 918 states have (on average 1.5250544662309369) internal successors, (1400), 918 states have internal predecessors, (1400), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-18 22:18:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1680 transitions. [2024-11-18 22:18:41,441 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1680 transitions. Word has length 150 [2024-11-18 22:18:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:41,442 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1680 transitions. [2024-11-18 22:18:41,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1680 transitions. [2024-11-18 22:18:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-18 22:18:41,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:41,445 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:41,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 22:18:41,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:41,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:41,446 INFO L85 PathProgramCache]: Analyzing trace with hash -851344952, now seen corresponding path program 1 times [2024-11-18 22:18:41,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:41,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106048060] [2024-11-18 22:18:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:41,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:18:41,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:41,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106048060] [2024-11-18 22:18:41,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106048060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:41,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:41,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:18:41,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852781677] [2024-11-18 22:18:41,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:41,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:41,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:41,596 INFO L87 Difference]: Start difference. First operand 1066 states and 1680 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:41,856 INFO L93 Difference]: Finished difference Result 3089 states and 4879 transitions. [2024-11-18 22:18:41,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:18:41,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-18 22:18:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:41,864 INFO L225 Difference]: With dead ends: 3089 [2024-11-18 22:18:41,864 INFO L226 Difference]: Without dead ends: 2070 [2024-11-18 22:18:41,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-18 22:18:41,868 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 258 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:41,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 546 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:18:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2024-11-18 22:18:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1926. [2024-11-18 22:18:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1694 states have (on average 1.5342384887839433) internal successors, (2599), 1694 states have internal predecessors, (2599), 220 states have call successors, (220), 11 states have call predecessors, (220), 11 states have return successors, (220), 220 states have call predecessors, (220), 220 states have call successors, (220) [2024-11-18 22:18:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 3039 transitions. [2024-11-18 22:18:41,976 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 3039 transitions. Word has length 152 [2024-11-18 22:18:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:41,976 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 3039 transitions. [2024-11-18 22:18:41,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 3039 transitions. [2024-11-18 22:18:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-18 22:18:41,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:41,979 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:41,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 22:18:41,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:41,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1837849851, now seen corresponding path program 1 times [2024-11-18 22:18:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:41,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218835357] [2024-11-18 22:18:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:18:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218835357] [2024-11-18 22:18:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218835357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:42,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:42,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:18:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575177172] [2024-11-18 22:18:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:42,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:42,257 INFO L87 Difference]: Start difference. First operand 1926 states and 3039 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:42,492 INFO L93 Difference]: Finished difference Result 4469 states and 6997 transitions. [2024-11-18 22:18:42,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:18:42,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-11-18 22:18:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:42,502 INFO L225 Difference]: With dead ends: 4469 [2024-11-18 22:18:42,502 INFO L226 Difference]: Without dead ends: 2614 [2024-11-18 22:18:42,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-18 22:18:42,507 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 161 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:42,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 436 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:18:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2024-11-18 22:18:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2476. [2024-11-18 22:18:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2244 states have (on average 1.5245098039215685) internal successors, (3421), 2244 states have internal predecessors, (3421), 220 states have call successors, (220), 11 states have call predecessors, (220), 11 states have return successors, (220), 220 states have call predecessors, (220), 220 states have call successors, (220) [2024-11-18 22:18:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3861 transitions. [2024-11-18 22:18:42,674 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3861 transitions. Word has length 154 [2024-11-18 22:18:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:42,676 INFO L471 AbstractCegarLoop]: Abstraction has 2476 states and 3861 transitions. [2024-11-18 22:18:42,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3861 transitions. [2024-11-18 22:18:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-18 22:18:42,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:42,678 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:42,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 22:18:42,678 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1596581598, now seen corresponding path program 1 times [2024-11-18 22:18:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509050660] [2024-11-18 22:18:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:18:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509050660] [2024-11-18 22:18:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509050660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:42,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:42,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:18:42,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731496974] [2024-11-18 22:18:42,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:42,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:42,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:42,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:42,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:42,860 INFO L87 Difference]: Start difference. First operand 2476 states and 3861 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:42,958 INFO L93 Difference]: Finished difference Result 4959 states and 7730 transitions. [2024-11-18 22:18:42,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:18:42,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-18 22:18:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:42,968 INFO L225 Difference]: With dead ends: 4959 [2024-11-18 22:18:42,968 INFO L226 Difference]: Without dead ends: 2531 [2024-11-18 22:18:42,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:42,972 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 2 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:42,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 505 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:18:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-11-18 22:18:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2531. [2024-11-18 22:18:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2299 states have (on average 1.5171813832100913) internal successors, (3488), 2299 states have internal predecessors, (3488), 220 states have call successors, (220), 11 states have call predecessors, (220), 11 states have return successors, (220), 220 states have call predecessors, (220), 220 states have call successors, (220) [2024-11-18 22:18:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3928 transitions. [2024-11-18 22:18:43,153 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3928 transitions. Word has length 156 [2024-11-18 22:18:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:43,154 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3928 transitions. [2024-11-18 22:18:43,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:18:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3928 transitions. [2024-11-18 22:18:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-18 22:18:43,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:43,156 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:43,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 22:18:43,157 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:43,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:43,157 INFO L85 PathProgramCache]: Analyzing trace with hash 752576096, now seen corresponding path program 1 times [2024-11-18 22:18:43,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:43,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075834716] [2024-11-18 22:18:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:43,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-18 22:18:43,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075834716] [2024-11-18 22:18:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075834716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:18:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977401991] [2024-11-18 22:18:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:43,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:43,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:43,370 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-18 22:18:43,371 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-18 22:18:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:43,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 22:18:43,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-18 22:18:43,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:18:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-18 22:18:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977401991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:18:43,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:18:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-18 22:18:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837056633] [2024-11-18 22:18:43,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:18:43,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 22:18:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:43,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 22:18:43,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 22:18:43,752 INFO L87 Difference]: Start difference. First operand 2531 states and 3928 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-18 22:18:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:44,006 INFO L93 Difference]: Finished difference Result 5047 states and 7796 transitions. [2024-11-18 22:18:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 22:18:44,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 156 [2024-11-18 22:18:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:44,016 INFO L225 Difference]: With dead ends: 5047 [2024-11-18 22:18:44,016 INFO L226 Difference]: Without dead ends: 2564 [2024-11-18 22:18:44,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-18 22:18:44,021 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 236 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:44,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 367 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:18:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-18 22:18:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2520. [2024-11-18 22:18:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 2277 states have (on average 1.4945103205972772) internal successors, (3403), 2277 states have internal predecessors, (3403), 220 states have call successors, (220), 22 states have call predecessors, (220), 22 states have return successors, (220), 220 states have call predecessors, (220), 220 states have call successors, (220) [2024-11-18 22:18:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3843 transitions. [2024-11-18 22:18:44,140 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3843 transitions. Word has length 156 [2024-11-18 22:18:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:44,141 INFO L471 AbstractCegarLoop]: Abstraction has 2520 states and 3843 transitions. [2024-11-18 22:18:44,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-18 22:18:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3843 transitions. [2024-11-18 22:18:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-18 22:18:44,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:44,144 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:44,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 22:18:44,348 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,SelfDestructingSolverStorable10 [2024-11-18 22:18:44,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:44,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:44,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1436283550, now seen corresponding path program 1 times [2024-11-18 22:18:44,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:44,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549487268] [2024-11-18 22:18:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 22:18:44,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670202624] [2024-11-18 22:18:44,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:44,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:44,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:44,518 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-18 22:18:44,520 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-18 22:18:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:18:44,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:18:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:18:44,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:18:44,819 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:18:44,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:18:44,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 22:18:45,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:45,026 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:45,143 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:18:45,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:18:45 BoogieIcfgContainer [2024-11-18 22:18:45,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:18:45,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:18:45,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:18:45,147 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:18:45,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:36" (3/4) ... [2024-11-18 22:18:45,150 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:18:45,151 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:18:45,151 INFO L158 Benchmark]: Toolchain (without parser) took 9845.00ms. Allocated memory was 192.9MB in the beginning and 492.8MB in the end (delta: 299.9MB). Free memory was 123.0MB in the beginning and 199.1MB in the end (delta: -76.1MB). Peak memory consumption was 224.3MB. Max. memory is 16.1GB. [2024-11-18 22:18:45,151 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:18:45,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.86ms. Allocated memory is still 192.9MB. Free memory was 122.7MB in the beginning and 104.6MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 22:18:45,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.07ms. Allocated memory is still 192.9MB. Free memory was 104.3MB in the beginning and 161.2MB in the end (delta: -56.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-18 22:18:45,152 INFO L158 Benchmark]: Boogie Preprocessor took 113.17ms. Allocated memory is still 192.9MB. Free memory was 161.2MB in the beginning and 153.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 22:18:45,153 INFO L158 Benchmark]: RCFGBuilder took 626.11ms. Allocated memory is still 192.9MB. Free memory was 153.2MB in the beginning and 110.3MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-18 22:18:45,153 INFO L158 Benchmark]: TraceAbstraction took 8464.64ms. Allocated memory was 192.9MB in the beginning and 492.8MB in the end (delta: 299.9MB). Free memory was 110.3MB in the beginning and 199.1MB in the end (delta: -88.7MB). Peak memory consumption was 213.2MB. Max. memory is 16.1GB. [2024-11-18 22:18:45,153 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 492.8MB. Free memory is still 199.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:18:45,155 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.17ms. Allocated memory is still 192.9MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.86ms. Allocated memory is still 192.9MB. Free memory was 122.7MB in the beginning and 104.6MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.07ms. Allocated memory is still 192.9MB. Free memory was 104.3MB in the beginning and 161.2MB in the end (delta: -56.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.17ms. Allocated memory is still 192.9MB. Free memory was 161.2MB in the beginning and 153.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 626.11ms. Allocated memory is still 192.9MB. Free memory was 153.2MB in the beginning and 110.3MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8464.64ms. Allocated memory was 192.9MB in the beginning and 492.8MB in the end (delta: 299.9MB). Free memory was 110.3MB in the beginning and 199.1MB in the end (delta: -88.7MB). Peak memory consumption was 213.2MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 492.8MB. Free memory is still 199.1MB. 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 189, overapproximation of bitwiseOr at line 189, overapproximation of bitwiseAnd at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.75; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_6 = -4; [L25] double var_1_7 = 49.8; [L26] double var_1_8 = 255.625; [L27] unsigned short int var_1_9 = 10; [L28] unsigned short int var_1_11 = 10000; [L29] signed char var_1_12 = 100; [L30] signed char var_1_13 = 16; [L31] unsigned long int var_1_14 = 4; [L32] signed short int var_1_15 = -16; [L33] unsigned char var_1_17 = 5; [L34] double var_1_18 = 64.75; [L35] double var_1_19 = 99.5; [L36] unsigned long int var_1_20 = 32; [L37] unsigned long int var_1_22 = 32; [L38] unsigned long int var_1_23 = 2461517415; [L39] unsigned long int var_1_24 = 1399914902; [L40] unsigned char var_1_25 = 2; [L41] signed long int var_1_26 = 4; [L42] unsigned char var_1_27 = 0; [L43] unsigned short int var_1_28 = 32; [L44] unsigned short int var_1_29 = 36457; [L45] double last_1_var_1_1 = 4.75; [L46] unsigned short int last_1_var_1_9 = 10; [L47] unsigned short int last_1_var_1_11 = 10000; [L48] unsigned long int last_1_var_1_14 = 4; [L49] signed short int last_1_var_1_15 = -16; [L50] unsigned char last_1_var_1_17 = 5; [L51] double last_1_var_1_18 = 64.75; [L52] unsigned long int last_1_var_1_20 = 32; [L53] unsigned long int last_1_var_1_22 = 32; [L54] unsigned char last_1_var_1_25 = 2; [L55] signed long int last_1_var_1_26 = 4; [L56] unsigned short int last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L193] isInitial = 1 [L194] FCALL initially() [L195] int k_loop; [L196] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L196] COND TRUE k_loop < 1 [L197] CALL updateLastVariables() [L175] last_1_var_1_1 = var_1_1 [L176] last_1_var_1_9 = var_1_9 [L177] last_1_var_1_11 = var_1_11 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_15 = var_1_15 [L180] last_1_var_1_17 = var_1_17 [L181] last_1_var_1_18 = var_1_18 [L182] last_1_var_1_20 = var_1_20 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_25 = var_1_25 [L185] last_1_var_1_26 = var_1_26 [L186] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L143] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L145] var_1_6 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L146] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L152] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L153] var_1_12 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L154] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L156] var_1_13 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L157] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L159] var_1_19 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L160] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L161] var_1_23 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L162] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L164] var_1_24 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_24 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L165] RET assume_abort_if_not(var_1_24 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L167] var_1_27 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L170] var_1_29 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L171] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L198] RET updateVariables() [L199] CALL step() [L60] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L60] signed long int stepLocal_0 = var_1_6 & 10000; [L61] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_0=10000, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L61] COND TRUE ((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < stepLocal_0 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L66] COND TRUE last_1_var_1_14 <= last_1_var_1_15 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L67] COND TRUE ((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13))) [L68] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L75] COND FALSE !(last_1_var_1_20 > last_1_var_1_15) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L80] COND TRUE last_1_var_1_14 <= 16 [L81] var_1_9 = last_1_var_1_25 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L84] unsigned long int stepLocal_5 = (3423867512u - var_1_13) - var_1_24; [L85] signed long int stepLocal_4 = 8; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] EXPR last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] COND TRUE stepLocal_4 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25)))) [L87] COND FALSE !(var_1_8 >= last_1_var_1_18) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] EXPR last_1_var_1_11 >> var_1_14 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] COND FALSE !(! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) [L98] signed char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_1=0, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L99] COND TRUE (var_1_9 + var_1_25) >= stepLocal_1 [L100] var_1_18 = ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L102] var_1_17 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L103] COND TRUE ! var_1_2 [L104] var_1_22 = (var_1_23 - var_1_25) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L108] COND TRUE var_1_7 >= 4.5 [L109] var_1_15 = (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L111] var_1_28 = (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) [L112] unsigned long int stepLocal_3 = var_1_22; [L113] signed char stepLocal_2 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_2=0, stepLocal_3=-2147483651, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L114] COND TRUE stepLocal_2 == (var_1_6 * (var_1_12 - 64)) [L115] var_1_20 = var_1_17 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L125] unsigned long int stepLocal_7 = var_1_14; [L126] unsigned long int stepLocal_6 = var_1_23; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=2350125689, stepLocal_6=-2147483649, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L127] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=2350125689, stepLocal_6=-2147483649, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L199] RET step() [L200] CALL, EXPR property() [L189] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR (((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR ((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189-L190] return ((((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13)))) && (var_1_2 ? ((var_1_23 >= var_1_25) ? (((var_1_25 - 10) <= var_1_14) ? (var_1_27 ? (var_1_26 == ((signed long int) (((((((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) < (var_1_17)) ? (((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) : (var_1_17))) + var_1_17))) : 1) : (var_1_26 == ((signed long int) ((((var_1_12) < (var_1_17)) ? (var_1_12) : (var_1_17)))))) : (var_1_26 == ((signed long int) ((-32 + var_1_22) + var_1_14)))) : 1)) && (var_1_28 == ((unsigned short int) (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2359 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2357 mSDsluCounter, 5635 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3626 mSDsCounter, 553 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 792 IncrementalHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 553 mSolverCounterUnsat, 2009 mSDtfsCounter, 792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2531occurred in iteration=10, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 1284 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2281 NumberOfCodeBlocks, 2281 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2107 ConstructedInterpolants, 0 QuantifiedInterpolants, 6178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 820 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 10467/10640 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-18 22:18:45,188 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_loopvsstraightlinecode_100-1loop_file-11.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 61d8b31ff1e9b7ded83368278938f158cc1aa40ff57fbd8a739b93a1e5cab26f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:18:47,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:18:47,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:18:47,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:18:47,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:18:47,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:18:47,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:18:47,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:18:47,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:18:47,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:18:47,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:18:47,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:18:47,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:18:47,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:18:47,712 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:18:47,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:18:47,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:18:47,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:18:47,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:18:47,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:18:47,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:18:47,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:18:47,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:18:47,720 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:18:47,721 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:18:47,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:18:47,721 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:18:47,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:18:47,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:18:47,722 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:18:47,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:18:47,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:18:47,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:18:47,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:18:47,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:18:47,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:18:47,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:18:47,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:18:47,724 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:18:47,724 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:18:47,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:18:47,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:18:47,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:18:47,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:18:47,726 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 -> 61d8b31ff1e9b7ded83368278938f158cc1aa40ff57fbd8a739b93a1e5cab26f [2024-11-18 22:18:48,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:18:48,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:18:48,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:18:48,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:18:48,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:18:48,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-18 22:18:49,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:18:49,841 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:18:49,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-18 22:18:49,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098e22a08/177f1b375ab444cd86e822cd8696e91b/FLAG5287c4f62 [2024-11-18 22:18:50,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098e22a08/177f1b375ab444cd86e822cd8696e91b [2024-11-18 22:18:50,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:18:50,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:18:50,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:18:50,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:18:50,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:18:50,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b8dca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50, skipping insertion in model container [2024-11-18 22:18:50,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:18:50,394 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_loopvsstraightlinecode_100-1loop_file-11.i[916,929] [2024-11-18 22:18:50,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:18:50,474 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:18:50,488 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_loopvsstraightlinecode_100-1loop_file-11.i[916,929] [2024-11-18 22:18:50,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:18:50,531 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:18:50,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50 WrapperNode [2024-11-18 22:18:50,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:18:50,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:18:50,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:18:50,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:18:50,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,587 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-11-18 22:18:50,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:18:50,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:18:50,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:18:50,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:18:50,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,611 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-18 22:18:50,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,620 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:18:50,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:18:50,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:18:50,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:18:50,652 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (1/1) ... [2024-11-18 22:18:50,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:18:50,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:50,719 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-18 22:18:50,722 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-18 22:18:50,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:18:50,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:18:50,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:18:50,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:18:50,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:18:50,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:18:50,925 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:18:50,931 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:18:53,686 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-18 22:18:53,687 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:18:53,700 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:18:53,700 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:18:53,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:53 BoogieIcfgContainer [2024-11-18 22:18:53,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:18:53,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:18:53,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:18:53,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:18:53,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:18:50" (1/3) ... [2024-11-18 22:18:53,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223b9750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:18:53, skipping insertion in model container [2024-11-18 22:18:53,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:50" (2/3) ... [2024-11-18 22:18:53,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223b9750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:18:53, skipping insertion in model container [2024-11-18 22:18:53,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:53" (3/3) ... [2024-11-18 22:18:53,708 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-18 22:18:53,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:18:53,723 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:18:53,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:18:53,785 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;@73940ef2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:18:53,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:18:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 22:18:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-18 22:18:53,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:53,802 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:53,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:53,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1299470666, now seen corresponding path program 1 times [2024-11-18 22:18:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:18:53,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159566657] [2024-11-18 22:18:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:53,840 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-18 22:18:53,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:18:53,845 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-18 22:18:53,860 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-18 22:18:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:54,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:18:54,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-18 22:18:54,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:18:54,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:18:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159566657] [2024-11-18 22:18:54,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159566657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:54,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:54,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:18:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220042859] [2024-11-18 22:18:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:54,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:18:54,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:18:54,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:18:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:18:54,426 INFO L87 Difference]: Start difference. First operand has 76 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-18 22:18:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:54,464 INFO L93 Difference]: Finished difference Result 149 states and 253 transitions. [2024-11-18 22:18:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:18:54,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2024-11-18 22:18:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:54,476 INFO L225 Difference]: With dead ends: 149 [2024-11-18 22:18:54,476 INFO L226 Difference]: Without dead ends: 72 [2024-11-18 22:18:54,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-18 22:18:54,485 INFO L432 NwaCegarLoop]: 115 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, 115 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-18 22:18:54,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:18:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-18 22:18:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-18 22:18:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 22:18:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2024-11-18 22:18:54,527 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 136 [2024-11-18 22:18:54,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:54,528 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2024-11-18 22:18:54,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-18 22:18:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2024-11-18 22:18:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-18 22:18:54,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:54,532 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:18:54,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 22:18:54,733 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-18 22:18:54,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:54,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1297244734, now seen corresponding path program 1 times [2024-11-18 22:18:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:18:54,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478668217] [2024-11-18 22:18:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:54,736 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-18 22:18:54,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:18:54,738 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-18 22:18:54,739 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-18 22:18:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:55,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 22:18:55,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:18:57,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:18:57,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:18:57,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478668217] [2024-11-18 22:18:57,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478668217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:57,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:57,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:18:57,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208119102] [2024-11-18 22:18:57,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:57,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:18:57,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:57,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:57,318 INFO L87 Difference]: Start difference. First operand 72 states and 111 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:19:00,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:19:05,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:19:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:19:05,201 INFO L93 Difference]: Finished difference Result 211 states and 328 transitions. [2024-11-18 22:19:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:19:05,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-18 22:19:05,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:19:05,237 INFO L225 Difference]: With dead ends: 211 [2024-11-18 22:19:05,237 INFO L226 Difference]: Without dead ends: 142 [2024-11-18 22:19:05,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:19:05,239 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 70 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-18 22:19:05,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 295 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2024-11-18 22:19:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-18 22:19:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 114. [2024-11-18 22:19:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-18 22:19:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 175 transitions. [2024-11-18 22:19:05,260 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 175 transitions. Word has length 136 [2024-11-18 22:19:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:19:05,261 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 175 transitions. [2024-11-18 22:19:05,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:19:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 175 transitions. [2024-11-18 22:19:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-18 22:19:05,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:19:05,263 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:19:05,282 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-18 22:19:05,463 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-18 22:19:05,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:19:05,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:19:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash 835772284, now seen corresponding path program 1 times [2024-11-18 22:19:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:19:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630654699] [2024-11-18 22:19:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:19:05,467 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-18 22:19:05,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:19:05,469 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-18 22:19:05,470 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-18 22:19:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:19:05,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 22:19:05,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:19:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:19:07,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:19:07,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:19:07,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630654699] [2024-11-18 22:19:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630654699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:19:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:19:07,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:19:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171304177] [2024-11-18 22:19:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:19:07,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:19:07,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:19:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:19:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:19:07,897 INFO L87 Difference]: Start difference. First operand 114 states and 175 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:19:11,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:19:15,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:19:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:19:15,435 INFO L93 Difference]: Finished difference Result 268 states and 413 transitions. [2024-11-18 22:19:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:19:15,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-18 22:19:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:19:15,440 INFO L225 Difference]: With dead ends: 268 [2024-11-18 22:19:15,440 INFO L226 Difference]: Without dead ends: 199 [2024-11-18 22:19:15,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:19:15,442 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 109 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-18 22:19:15,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 328 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-18 22:19:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-18 22:19:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 179. [2024-11-18 22:19:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 115 states have internal predecessors, (156), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-18 22:19:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 276 transitions. [2024-11-18 22:19:15,468 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 276 transitions. Word has length 137 [2024-11-18 22:19:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:19:15,469 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 276 transitions. [2024-11-18 22:19:15,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:19:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 276 transitions. [2024-11-18 22:19:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-18 22:19:15,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:19:15,471 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:19:15,489 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-18 22:19:15,675 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-18 22:19:15,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:19:15,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:19:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash -609296260, now seen corresponding path program 1 times [2024-11-18 22:19:15,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:19:15,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610841985] [2024-11-18 22:19:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:19:15,678 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-18 22:19:15,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:19:15,680 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-18 22:19:15,681 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-18 22:19:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:19:15,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 22:19:15,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:19:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:19:16,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:19:16,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:19:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610841985] [2024-11-18 22:19:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610841985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:19:16,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:19:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:19:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039500290] [2024-11-18 22:19:16,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:19:16,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 22:19:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:19:16,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 22:19:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:19:16,764 INFO L87 Difference]: Start difference. First operand 179 states and 276 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:19:20,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:19:25,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:19:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:19:25,315 INFO L93 Difference]: Finished difference Result 354 states and 548 transitions. [2024-11-18 22:19:25,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 22:19:25,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-18 22:19:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:19:25,345 INFO L225 Difference]: With dead ends: 354 [2024-11-18 22:19:25,345 INFO L226 Difference]: Without dead ends: 220 [2024-11-18 22:19:25,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 22:19:25,353 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 76 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-18 22:19:25,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 365 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2024-11-18 22:19:25,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-18 22:19:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 181. [2024-11-18 22:19:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-18 22:19:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 278 transitions. [2024-11-18 22:19:25,402 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 278 transitions. Word has length 137 [2024-11-18 22:19:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:19:25,402 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 278 transitions. [2024-11-18 22:19:25,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:19:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 278 transitions. [2024-11-18 22:19:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-18 22:19:25,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:19:25,404 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:19:25,432 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-18 22:19:25,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:19:25,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:19:25,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:19:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1305706502, now seen corresponding path program 1 times [2024-11-18 22:19:25,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:19:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578957380] [2024-11-18 22:19:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:19:25,616 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-18 22:19:25,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:19:25,619 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:19:25,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-18 22:19:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:19:26,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 22:19:26,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:19:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-18 22:19:27,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:19:28,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:19:28,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578957380] [2024-11-18 22:19:28,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578957380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:19:28,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [326799108] [2024-11-18 22:19:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:19:28,249 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-18 22:19:28,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-18 22:19:28,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-18 22:19:28,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-18 22:19:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:19:28,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 22:19:28,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:19:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:19:32,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:19:32,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [326799108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:19:32,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:19:32,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-11-18 22:19:32,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901833229] [2024-11-18 22:19:32,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:19:32,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 22:19:32,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:19:32,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 22:19:32,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-18 22:19:32,127 INFO L87 Difference]: Start difference. First operand 181 states and 278 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:19:39,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 22:19:42,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 22:19:45,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:19:52,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 22:19:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:19:54,005 INFO L93 Difference]: Finished difference Result 636 states and 977 transitions. [2024-11-18 22:19:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 22:19:54,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-18 22:19:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:19:54,022 INFO L225 Difference]: With dead ends: 636 [2024-11-18 22:19:54,022 INFO L226 Difference]: Without dead ends: 502 [2024-11-18 22:19:54,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-18 22:19:54,024 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 322 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:19:54,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 378 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 305 Invalid, 1 Unknown, 0 Unchecked, 21.0s Time] [2024-11-18 22:19:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-18 22:19:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 421. [2024-11-18 22:19:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 295 states have (on average 1.4101694915254237) internal successors, (416), 297 states have internal predecessors, (416), 118 states have call successors, (118), 7 states have call predecessors, (118), 7 states have return successors, (118), 116 states have call predecessors, (118), 118 states have call successors, (118) [2024-11-18 22:19:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 652 transitions. [2024-11-18 22:19:54,111 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 652 transitions. Word has length 138 [2024-11-18 22:19:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:19:54,113 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 652 transitions. [2024-11-18 22:19:54,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:19:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 652 transitions. [2024-11-18 22:19:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-18 22:19:54,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:19:54,118 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:19:54,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-18 22:19:54,339 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 (6)] Forceful destruction successful, exit code 0 [2024-11-18 22:19:54,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:19:54,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:19:54,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:19:54,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1047541064, now seen corresponding path program 1 times [2024-11-18 22:19:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:19:54,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398099801] [2024-11-18 22:19:54,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:19:54,524 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-18 22:19:54,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:19:54,527 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-18 22:19:54,528 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-18 22:19:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:19:54,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 22:19:54,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:19:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-18 22:19:57,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:19:58,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:19:58,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398099801] [2024-11-18 22:19:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398099801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:19:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [517872379] [2024-11-18 22:19:58,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:19:58,743 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-18 22:19:58,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-18 22:19:58,746 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-18 22:19:58,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-18 22:19:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:19:59,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 22:19:59,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:20:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:20:05,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:20:05,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [517872379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:20:05,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:20:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-18 22:20:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478088761] [2024-11-18 22:20:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:20:05,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 22:20:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:20:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 22:20:05,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-18 22:20:05,055 INFO L87 Difference]: Start difference. First operand 421 states and 652 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)