./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-while_file-45.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 c1eefa48d2d2d0e0297fcc2acb2c6cc9c9e34b949fc6fbd7ce865e72d2e07400 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:14:33,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:14:33,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:14:33,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:14:33,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:14:33,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:14:33,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:14:33,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:14:33,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:14:33,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:14:33,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:14:33,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:14:33,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:14:33,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:14:33,551 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:14:33,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:14:33,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:14:33,552 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:14:33,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:14:33,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:14:33,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:14:33,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:14:33,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:14:33,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:14:33,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:14:33,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:14:33,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:14:33,556 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:14:33,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:14:33,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:14:33,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:14:33,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:14:33,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:14:33,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:14:33,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:14:33,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:14:33,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:14:33,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:14:33,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:14:33,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:14:33,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:14:33,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:14:33,562 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 -> c1eefa48d2d2d0e0297fcc2acb2c6cc9c9e34b949fc6fbd7ce865e72d2e07400 [2024-11-10 07:14:33,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:14:33,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:14:33,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:14:33,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:14:33,860 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:14:33,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-45.i [2024-11-10 07:14:35,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:14:35,524 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:14:35,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-45.i [2024-11-10 07:14:35,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1fd40cb4/87d81526267647fa8d5ca2834e4fb0b3/FLAG872f4f2e9 [2024-11-10 07:14:35,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1fd40cb4/87d81526267647fa8d5ca2834e4fb0b3 [2024-11-10 07:14:35,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:14:35,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:14:35,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:14:35,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:14:35,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:14:35,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:35,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3391db4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35, skipping insertion in model container [2024-11-10 07:14:35,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:35,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:14:35,746 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-while_file-45.i[916,929] [2024-11-10 07:14:35,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:14:35,850 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:14:35,868 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-while_file-45.i[916,929] [2024-11-10 07:14:35,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:14:35,959 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:14:35,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35 WrapperNode [2024-11-10 07:14:35,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:14:35,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:14:35,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:14:35,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:14:35,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,066 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2024-11-10 07:14:36,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:14:36,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:14:36,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:14:36,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:14:36,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,105 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-10 07:14:36,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:14:36,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:14:36,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:14:36,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:14:36,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (1/1) ... [2024-11-10 07:14:36,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:14:36,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:36,184 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-10 07:14:36,186 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-10 07:14:36,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:14:36,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:14:36,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:14:36,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:14:36,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:14:36,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:14:36,355 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:14:36,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:14:36,853 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L192: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~bitwise25#1;havoc property_#t~short26#1; [2024-11-10 07:14:36,904 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-10 07:14:36,904 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:14:36,929 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:14:36,929 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:14:36,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:14:36 BoogieIcfgContainer [2024-11-10 07:14:36,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:14:36,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:14:36,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:14:36,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:14:36,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:14:35" (1/3) ... [2024-11-10 07:14:36,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9cccc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:14:36, skipping insertion in model container [2024-11-10 07:14:36,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:14:35" (2/3) ... [2024-11-10 07:14:36,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9cccc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:14:36, skipping insertion in model container [2024-11-10 07:14:36,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:14:36" (3/3) ... [2024-11-10 07:14:36,940 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-45.i [2024-11-10 07:14:36,956 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:14:36,957 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:14:37,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:14:37,015 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;@37ddb1c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:14:37,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:14:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 71 states have (on average 1.352112676056338) internal successors, (96), 72 states have internal predecessors, (96), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 07:14:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 07:14:37,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:37,033 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:37,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:37,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:37,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1172269115, now seen corresponding path program 1 times [2024-11-10 07:14:37,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:37,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957632778] [2024-11-10 07:14:37,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:14:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:14:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:14:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:14:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:14:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:14:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:14:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:14:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:14:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:14:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:14:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:14:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:14:37,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:37,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957632778] [2024-11-10 07:14:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957632778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:37,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:37,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:14:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273789004] [2024-11-10 07:14:37,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:37,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:14:37,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:14:37,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:14:37,635 INFO L87 Difference]: Start difference. First operand has 103 states, 71 states have (on average 1.352112676056338) internal successors, (96), 72 states have internal predecessors, (96), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 07:14:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:37,678 INFO L93 Difference]: Finished difference Result 198 states and 330 transitions. [2024-11-10 07:14:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:14:37,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 194 [2024-11-10 07:14:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:37,690 INFO L225 Difference]: With dead ends: 198 [2024-11-10 07:14:37,690 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 07:14:37,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-10 07:14:37,701 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:37,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:14:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 07:14:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 07:14:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 07:14:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2024-11-10 07:14:37,760 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 194 [2024-11-10 07:14:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:37,760 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2024-11-10 07:14:37,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 07:14:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2024-11-10 07:14:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 07:14:37,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:37,765 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:37,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:14:37,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:37,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:37,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1425078332, now seen corresponding path program 1 times [2024-11-10 07:14:37,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:37,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175578130] [2024-11-10 07:14:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:37,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:14:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:14:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:14:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:14:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:14:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:14:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:14:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:14:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:14:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:14:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:14:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:14:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:14:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175578130] [2024-11-10 07:14:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175578130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:38,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:14:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070784454] [2024-11-10 07:14:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:38,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:14:38,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:14:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:14:38,773 INFO L87 Difference]: Start difference. First operand 98 states and 146 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:14:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:39,074 INFO L93 Difference]: Finished difference Result 290 states and 434 transitions. [2024-11-10 07:14:39,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:14:39,075 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-10 07:14:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:39,078 INFO L225 Difference]: With dead ends: 290 [2024-11-10 07:14:39,078 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 07:14:39,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-10 07:14:39,081 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 117 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:39,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 399 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:14:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 07:14:39,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2024-11-10 07:14:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:14:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 236 transitions. [2024-11-10 07:14:39,129 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 236 transitions. Word has length 194 [2024-11-10 07:14:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:39,130 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 236 transitions. [2024-11-10 07:14:39,130 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:14:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 236 transitions. [2024-11-10 07:14:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 07:14:39,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:39,137 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:39,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:14:39,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:39,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash 180313851, now seen corresponding path program 1 times [2024-11-10 07:14:39,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:39,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474707339] [2024-11-10 07:14:39,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:14:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:14:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:14:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:14:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:14:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:14:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:14:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:14:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:14:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:14:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:14:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:14:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:14:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:40,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474707339] [2024-11-10 07:14:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474707339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:40,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:40,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:14:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287238581] [2024-11-10 07:14:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:40,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:14:40,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:40,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:14:40,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:14:40,201 INFO L87 Difference]: Start difference. First operand 157 states and 236 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:14:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:40,466 INFO L93 Difference]: Finished difference Result 290 states and 433 transitions. [2024-11-10 07:14:40,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:14:40,467 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-10 07:14:40,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:40,469 INFO L225 Difference]: With dead ends: 290 [2024-11-10 07:14:40,470 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 07:14:40,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:14:40,475 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 92 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:40,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 390 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:14:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 07:14:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 159. [2024-11-10 07:14:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:14:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 238 transitions. [2024-11-10 07:14:40,512 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 238 transitions. Word has length 194 [2024-11-10 07:14:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:40,515 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 238 transitions. [2024-11-10 07:14:40,516 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:14:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 238 transitions. [2024-11-10 07:14:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 07:14:40,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:40,520 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:40,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:14:40,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:40,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:40,521 INFO L85 PathProgramCache]: Analyzing trace with hash 857878820, now seen corresponding path program 1 times [2024-11-10 07:14:40,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:40,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995250259] [2024-11-10 07:14:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:14:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:14:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:14:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:14:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:14:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:14:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:14:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:40,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:14:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:14:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:14:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:14:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:14:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:14:41,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:41,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995250259] [2024-11-10 07:14:41,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995250259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:14:41,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608563742] [2024-11-10 07:14:41,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:41,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:41,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:41,068 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-10 07:14:41,070 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-10 07:14:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:41,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:14:41,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 820 proven. 48 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2024-11-10 07:14:41,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:14:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:14:41,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608563742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:14:41,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:14:41,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:14:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092461076] [2024-11-10 07:14:41,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:14:41,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:14:41,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:41,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:14:41,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:14:41,848 INFO L87 Difference]: Start difference. First operand 159 states and 238 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-10 07:14:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:42,097 INFO L93 Difference]: Finished difference Result 270 states and 395 transitions. [2024-11-10 07:14:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:14:42,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 195 [2024-11-10 07:14:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:42,100 INFO L225 Difference]: With dead ends: 270 [2024-11-10 07:14:42,100 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 07:14:42,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:14:42,104 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 138 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:42,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 264 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:14:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 07:14:42,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2024-11-10 07:14:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:14:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2024-11-10 07:14:42,142 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 195 [2024-11-10 07:14:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:42,144 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2024-11-10 07:14:42,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-10 07:14:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2024-11-10 07:14:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 07:14:42,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:42,147 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:42,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:14:42,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:42,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:42,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1415657573, now seen corresponding path program 1 times [2024-11-10 07:14:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:42,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642232317] [2024-11-10 07:14:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:42,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:14:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:14:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:14:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:14:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:14:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:14:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:14:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:14:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:14:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:14:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:14:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:14:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:14:42,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:42,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642232317] [2024-11-10 07:14:42,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642232317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:14:42,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473963141] [2024-11-10 07:14:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:42,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:42,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:42,837 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-10 07:14:42,840 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-10 07:14:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:43,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:14:43,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 840 proven. 42 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2024-11-10 07:14:43,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:14:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:14:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473963141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:14:43,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:14:43,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:14:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094971014] [2024-11-10 07:14:43,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:14:43,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:14:43,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:43,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:14:43,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:14:43,442 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-10 07:14:47,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 07:14:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:47,038 INFO L93 Difference]: Finished difference Result 286 states and 406 transitions. [2024-11-10 07:14:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:14:47,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 196 [2024-11-10 07:14:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:47,045 INFO L225 Difference]: With dead ends: 286 [2024-11-10 07:14:47,045 INFO L226 Difference]: Without dead ends: 187 [2024-11-10 07:14:47,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:14:47,046 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 137 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:47,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 261 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-10 07:14:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-10 07:14:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 175. [2024-11-10 07:14:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 110 states have (on average 1.2) internal successors, (132), 110 states have internal predecessors, (132), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:14:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2024-11-10 07:14:47,075 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 196 [2024-11-10 07:14:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:47,075 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2024-11-10 07:14:47,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-10 07:14:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2024-11-10 07:14:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 07:14:47,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:47,077 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:47,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 07:14:47,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:47,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:47,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1882237370, now seen corresponding path program 1 times [2024-11-10 07:14:47,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:47,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896067714] [2024-11-10 07:14:47,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:47,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:14:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:14:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:14:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:14:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:14:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:14:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:14:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:14:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:14:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:14:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:14:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:14:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 54 proven. 30 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:14:47,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:47,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896067714] [2024-11-10 07:14:47,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896067714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:14:47,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880253699] [2024-11-10 07:14:47,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:47,913 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-10 07:14:47,914 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-10 07:14:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:48,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 07:14:48,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 784 proven. 30 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-11-10 07:14:48,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:14:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 54 proven. 30 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:14:48,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880253699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:14:48,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:14:48,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 07:14:48,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026874898] [2024-11-10 07:14:48,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:14:48,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 07:14:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:48,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 07:14:48,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:14:48,707 INFO L87 Difference]: Start difference. First operand 175 states and 248 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-10 07:14:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:49,341 INFO L93 Difference]: Finished difference Result 303 states and 420 transitions. [2024-11-10 07:14:49,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 07:14:49,342 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 196 [2024-11-10 07:14:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:49,345 INFO L225 Difference]: With dead ends: 303 [2024-11-10 07:14:49,346 INFO L226 Difference]: Without dead ends: 200 [2024-11-10 07:14:49,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2024-11-10 07:14:49,348 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 330 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:49,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 457 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:14:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-10 07:14:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 183. [2024-11-10 07:14:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 116 states have internal predecessors, (136), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:14:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 252 transitions. [2024-11-10 07:14:49,381 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 252 transitions. Word has length 196 [2024-11-10 07:14:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:49,383 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 252 transitions. [2024-11-10 07:14:49,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-10 07:14:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 252 transitions. [2024-11-10 07:14:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 07:14:49,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:49,386 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:49,405 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-10 07:14:49,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:49,587 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:49,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2073603455, now seen corresponding path program 1 times [2024-11-10 07:14:49,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:49,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280927902] [2024-11-10 07:14:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:14:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:14:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:14:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:14:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:14:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:14:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:14:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:14:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:14:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:14:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:14:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:14:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:14:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:14:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:14:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:14:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:14:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:14:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:50,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:14:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:14:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:14:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:14:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:14:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:14:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:14:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:14:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:14:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:14:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:14:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:14:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280927902] [2024-11-10 07:14:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280927902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:14:51,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:14:51,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:14:51,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526067079] [2024-11-10 07:14:51,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:14:51,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:14:51,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:51,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:14:51,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:14:51,151 INFO L87 Difference]: Start difference. First operand 183 states and 252 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:14:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:51,738 INFO L93 Difference]: Finished difference Result 383 states and 518 transitions. [2024-11-10 07:14:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 07:14:51,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 199 [2024-11-10 07:14:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:51,743 INFO L225 Difference]: With dead ends: 383 [2024-11-10 07:14:51,743 INFO L226 Difference]: Without dead ends: 276 [2024-11-10 07:14:51,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2024-11-10 07:14:51,745 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 411 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:51,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 493 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 07:14:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-10 07:14:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 195. [2024-11-10 07:14:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 128 states have (on average 1.1875) internal successors, (152), 128 states have internal predecessors, (152), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:14:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 268 transitions. [2024-11-10 07:14:51,775 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 268 transitions. Word has length 199 [2024-11-10 07:14:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:51,775 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 268 transitions. [2024-11-10 07:14:51,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:14:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 268 transitions. [2024-11-10 07:14:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 07:14:51,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:51,779 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:51,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:14:51,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:51,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1715805216, now seen corresponding path program 1 times [2024-11-10 07:14:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38345829] [2024-11-10 07:14:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:14:52,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810216369] [2024-11-10 07:14:52,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:52,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:52,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:52,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:14:52,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 07:14:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:52,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 07:14:52,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 372 proven. 225 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-10 07:14:54,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:14:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:14:56,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38345829] [2024-11-10 07:14:56,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:14:56,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810216369] [2024-11-10 07:14:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810216369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:14:56,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:14:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-10 07:14:56,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813423469] [2024-11-10 07:14:56,080 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 07:14:56,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 07:14:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:14:56,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 07:14:56,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=440, Unknown=8, NotChecked=0, Total=552 [2024-11-10 07:14:56,082 INFO L87 Difference]: Start difference. First operand 195 states and 268 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 16 states have internal predecessors, (69), 4 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-10 07:14:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:14:57,626 INFO L93 Difference]: Finished difference Result 385 states and 513 transitions. [2024-11-10 07:14:57,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 07:14:57,627 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 16 states have internal predecessors, (69), 4 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 199 [2024-11-10 07:14:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:14:57,629 INFO L225 Difference]: With dead ends: 385 [2024-11-10 07:14:57,629 INFO L226 Difference]: Without dead ends: 275 [2024-11-10 07:14:57,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=346, Invalid=1451, Unknown=9, NotChecked=0, Total=1806 [2024-11-10 07:14:57,631 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 345 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 80 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:14:57,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 885 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 975 Invalid, 12 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 07:14:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-10 07:14:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 215. [2024-11-10 07:14:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 145 states have (on average 1.186206896551724) internal successors, (172), 145 states have internal predecessors, (172), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:14:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 288 transitions. [2024-11-10 07:14:57,667 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 288 transitions. Word has length 199 [2024-11-10 07:14:57,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:14:57,668 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 288 transitions. [2024-11-10 07:14:57,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 16 states have internal predecessors, (69), 4 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-10 07:14:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 288 transitions. [2024-11-10 07:14:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 07:14:57,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:14:57,670 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:57,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 07:14:57,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:57,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:14:57,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:14:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash 144154498, now seen corresponding path program 1 times [2024-11-10 07:14:57,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:14:57,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952500650] [2024-11-10 07:14:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:57,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:14:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:14:58,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376128978] [2024-11-10 07:14:58,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:14:58,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:14:58,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:14:58,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:14:58,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 07:14:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:14:58,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 07:14:58,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:14:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 819 proven. 120 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-10 07:14:59,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:15:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:15:00,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:15:00,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952500650] [2024-11-10 07:15:00,189 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:15:00,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376128978] [2024-11-10 07:15:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376128978] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 07:15:00,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:15:00,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-10 07:15:00,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310170611] [2024-11-10 07:15:00,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:15:00,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:15:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:15:00,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:15:00,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-10 07:15:00,191 INFO L87 Difference]: Start difference. First operand 215 states and 288 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:15:01,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-10 07:15:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:15:02,009 INFO L93 Difference]: Finished difference Result 341 states and 464 transitions. [2024-11-10 07:15:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:15:02,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 199 [2024-11-10 07:15:02,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:15:02,015 INFO L225 Difference]: With dead ends: 341 [2024-11-10 07:15:02,015 INFO L226 Difference]: Without dead ends: 234 [2024-11-10 07:15:02,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-10 07:15:02,019 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 55 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:15:02,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 457 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 07:15:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-10 07:15:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 218. [2024-11-10 07:15:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 148 states have (on average 1.1824324324324325) internal successors, (175), 148 states have internal predecessors, (175), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:15:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 291 transitions. [2024-11-10 07:15:02,051 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 291 transitions. Word has length 199 [2024-11-10 07:15:02,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:15:02,052 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 291 transitions. [2024-11-10 07:15:02,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:15:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 291 transitions. [2024-11-10 07:15:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 07:15:02,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:15:02,055 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:15:02,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 07:15:02,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:15:02,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:15:02,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:15:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash -361404127, now seen corresponding path program 1 times [2024-11-10 07:15:02,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:15:02,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344908113] [2024-11-10 07:15:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:02,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:15:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:15:02,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828322693] [2024-11-10 07:15:02,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:02,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:15:02,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:15:02,487 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:15:02,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 07:15:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:15:02,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:15:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:15:03,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:15:03,137 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:15:03,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:15:03,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 07:15:03,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:15:03,344 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:15:03,488 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:15:03,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:15:03 BoogieIcfgContainer [2024-11-10 07:15:03,492 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:15:03,492 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:15:03,493 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:15:03,493 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:15:03,493 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:14:36" (3/4) ... [2024-11-10 07:15:03,495 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:15:03,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:15:03,497 INFO L158 Benchmark]: Toolchain (without parser) took 27949.27ms. Allocated memory was 176.2MB in the beginning and 488.6MB in the end (delta: 312.5MB). Free memory was 104.6MB in the beginning and 414.2MB in the end (delta: -309.6MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-10 07:15:03,497 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 131.1MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:15:03,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.09ms. Allocated memory is still 176.2MB. Free memory was 104.5MB in the beginning and 143.8MB in the end (delta: -39.4MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-10 07:15:03,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.37ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 139.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:15:03,498 INFO L158 Benchmark]: Boogie Preprocessor took 77.09ms. Allocated memory is still 176.2MB. Free memory was 139.0MB in the beginning and 131.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 07:15:03,498 INFO L158 Benchmark]: IcfgBuilder took 784.71ms. Allocated memory is still 176.2MB. Free memory was 131.3MB in the beginning and 97.7MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 07:15:03,498 INFO L158 Benchmark]: TraceAbstraction took 26559.42ms. Allocated memory was 176.2MB in the beginning and 488.6MB in the end (delta: 312.5MB). Free memory was 97.1MB in the beginning and 414.2MB in the end (delta: -317.1MB). Peak memory consumption was 249.0MB. Max. memory is 16.1GB. [2024-11-10 07:15:03,498 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 488.6MB. Free memory is still 414.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:15:03,499 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.25ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 131.1MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.09ms. Allocated memory is still 176.2MB. Free memory was 104.5MB in the beginning and 143.8MB in the end (delta: -39.4MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.37ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 139.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.09ms. Allocated memory is still 176.2MB. Free memory was 139.0MB in the beginning and 131.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 784.71ms. Allocated memory is still 176.2MB. Free memory was 131.3MB in the beginning and 97.7MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26559.42ms. Allocated memory was 176.2MB in the beginning and 488.6MB in the end (delta: 312.5MB). Free memory was 97.1MB in the beginning and 414.2MB in the end (delta: -317.1MB). Peak memory consumption was 249.0MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 488.6MB. Free memory is still 414.2MB. 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 192, overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of someBinaryArithmeticFLOAToperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] signed long int var_1_5 = 32; [L24] unsigned char var_1_6 = 16; [L25] unsigned long int var_1_7 = 64; [L26] unsigned char var_1_8 = 128; [L27] double var_1_9 = 99999.2; [L28] double var_1_10 = 31.9; [L29] double var_1_11 = 8.5; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_13 = 0; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_15 = 0; [L34] double var_1_16 = 63.5; [L35] double var_1_17 = 1.75; [L36] double var_1_18 = 4.25; [L37] double var_1_19 = 127.7; [L38] unsigned char var_1_20 = 0; [L39] signed long int var_1_21 = -2; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] float var_1_24 = 999999999.6; [L43] float var_1_25 = 99999999999999.5; [L44] signed char var_1_26 = 32; [L45] signed char var_1_27 = 64; [L46] signed char var_1_28 = 32; [L47] signed char var_1_29 = 4; [L48] unsigned char var_1_30 = 0; [L49] unsigned char var_1_31 = 0; [L50] signed long int var_1_32 = 128; [L51] signed short int var_1_34 = -25; [L52] unsigned char var_1_36 = 64; [L53] unsigned long int last_1_var_1_1 = 0; [L54] unsigned char last_1_var_1_6 = 16; [L55] double last_1_var_1_16 = 63.5; [L56] unsigned char last_1_var_1_20 = 0; [L57] signed long int last_1_var_1_32 = 128; [L58] signed short int last_1_var_1_34 = -25; [L59] unsigned char last_1_var_1_36 = 64; VAL [isInitial=0, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=32, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L196] isInitial = 1 [L197] FCALL initially() [L198] COND TRUE 1 [L199] CALL updateLastVariables() [L183] last_1_var_1_1 = var_1_1 [L184] last_1_var_1_6 = var_1_6 [L185] last_1_var_1_16 = var_1_16 [L186] last_1_var_1_20 = var_1_20 [L187] last_1_var_1_32 = var_1_32 [L188] last_1_var_1_34 = var_1_34 [L189] last_1_var_1_36 = var_1_36 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=32, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L199] RET updateLastVariables() [L200] CALL updateVariables() [L135] var_1_5 = __VERIFIER_nondet_long() [L136] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L136] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L137] CALL assume_abort_if_not(var_1_5 <= 33) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L137] RET assume_abort_if_not(var_1_5 <= 33) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L138] var_1_7 = __VERIFIER_nondet_ulong() [L139] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L139] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L140] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L140] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L141] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=128, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=128, var_1_9=499996/5] [L141] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=128, var_1_9=499996/5] [L142] var_1_8 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_8 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L143] RET assume_abort_if_not(var_1_8 >= 127) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L144] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L144] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L145] var_1_10 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L146] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L147] var_1_11 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L148] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L150] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L151] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L151] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L152] var_1_14 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L153] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L154] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L154] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L155] var_1_15 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L156] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L157] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L157] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L158] var_1_17 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L159] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L160] var_1_18 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L161] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L162] var_1_19 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L163] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L164] var_1_23 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L165] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L166] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L166] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L167] var_1_25 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L168] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L169] var_1_27 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_27 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L170] RET assume_abort_if_not(var_1_27 >= 63) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L171] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L171] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L172] var_1_28 = __VERIFIER_nondet_char() [L173] CALL assume_abort_if_not(var_1_28 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L173] RET assume_abort_if_not(var_1_28 >= 31) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L174] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L174] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L175] var_1_29 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L176] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L177] CALL assume_abort_if_not(var_1_29 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L177] RET assume_abort_if_not(var_1_29 <= 31) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L178] var_1_31 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L179] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L200] RET updateVariables() [L201] CALL step() [L63] EXPR var_1_29 >> var_1_5 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L63] COND FALSE !(! (((((last_1_var_1_6) > (last_1_var_1_36)) ? (last_1_var_1_6) : (last_1_var_1_36))) > (var_1_29 >> var_1_5))) [L68] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L70] signed long int stepLocal_6 = (((last_1_var_1_34) < ((last_1_var_1_6 % var_1_8))) ? (last_1_var_1_34) : ((last_1_var_1_6 % var_1_8))); VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_6=-25, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L71] COND TRUE stepLocal_6 >= last_1_var_1_1 [L72] var_1_20 = (var_1_5 + ((((16) < (1)) ? (16) : (1)))) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L74] unsigned long int stepLocal_3 = (((var_1_5) > (last_1_var_1_1)) ? (var_1_5) : (last_1_var_1_1)); [L75] signed long int stepLocal_2 = var_1_5; VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_2=0, stepLocal_3=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L76] COND TRUE stepLocal_2 >= ((((last_1_var_1_20) > (last_1_var_1_1)) ? (last_1_var_1_20) : (last_1_var_1_1))) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_3=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L77] COND FALSE !(stepLocal_3 > (last_1_var_1_36 / var_1_7)) [L80] var_1_6 = (var_1_8 - var_1_5) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=64, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=499996/5] [L85] var_1_21 = ((256 + (var_1_8 + var_1_5)) - var_1_6) [L86] var_1_9 = ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) [L87] var_1_12 = (var_1_13 || (var_1_14 || var_1_15)) [L88] var_1_22 = (! (var_1_15 || (! var_1_23))) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=64, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L89] COND TRUE (var_1_17 / 31.375f) < 100.25 [L90] var_1_24 = (var_1_25 + 128.6f) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=64, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L92] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=64, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L95] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=64, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L99] var_1_30 = (var_1_12 || (var_1_23 && (var_1_12 || var_1_31))) [L100] var_1_36 = var_1_5 [L101] unsigned char stepLocal_7 = var_1_20; VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_7=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=128, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L102] COND TRUE stepLocal_7 < (var_1_20 + var_1_6) [L103] var_1_32 = (var_1_34 + var_1_5) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L107] unsigned char stepLocal_1 = var_1_36 >= var_1_21; VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_1=0, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L108] EXPR (var_1_36 * var_1_21) >> var_1_5 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_1=0, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L108] signed long int stepLocal_0 = (var_1_36 * var_1_21) >> var_1_5; [L109] COND TRUE stepLocal_1 || var_1_22 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_0=0, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L110] COND FALSE !(stepLocal_0 >= 50u) [L113] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L118] unsigned long int stepLocal_5 = var_1_7 * var_1_1; [L119] unsigned long int stepLocal_4 = 1u; VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_4=1, stepLocal_5=0, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L120] COND FALSE !(var_1_20 < stepLocal_4) [L131] var_1_16 = ((((var_1_18) > (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10))))) ? (var_1_18) : (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10)))))) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_5=0, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L201] RET step() [L202] CALL, EXPR property() [L192] EXPR ((var_1_36 >= var_1_21) || var_1_22) ? ((((var_1_36 * var_1_21) >> var_1_5) >= 50u) ? (var_1_1 == ((unsigned long int) var_1_5)) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_5)) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L192] EXPR (var_1_36 * var_1_21) >> var_1_5 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L192] EXPR ((var_1_36 >= var_1_21) || var_1_22) ? ((((var_1_36 * var_1_21) >> var_1_5) >= 50u) ? (var_1_1 == ((unsigned long int) var_1_5)) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_5)) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L192] EXPR ((((((((((((((var_1_36 >= var_1_21) || var_1_22) ? ((((var_1_36 * var_1_21) >> var_1_5) >= 50u) ? (var_1_1 == ((unsigned long int) var_1_5)) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_5))) && ((var_1_5 >= ((((last_1_var_1_20) > (last_1_var_1_1)) ? (last_1_var_1_20) : (last_1_var_1_1)))) ? ((((((var_1_5) > (last_1_var_1_1)) ? (var_1_5) : (last_1_var_1_1))) > (last_1_var_1_36 / var_1_7)) ? (var_1_6 == ((unsigned char) (var_1_5 + 32))) : (var_1_6 == ((unsigned char) (var_1_8 - var_1_5)))) : (var_1_6 == ((unsigned char) var_1_5)))) && (var_1_9 == ((double) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11)))))) && (var_1_12 == ((unsigned char) (var_1_13 || (var_1_14 || var_1_15))))) && ((var_1_20 < 1u) ? ((! (var_1_7 >= var_1_5)) ? ((var_1_20 < (var_1_7 * var_1_1)) ? (var_1_16 == ((double) 31.6)) : (var_1_16 == ((double) (var_1_17 - ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))))) : (var_1_16 == ((double) ((((var_1_18 + var_1_19) < 0 ) ? -(var_1_18 + var_1_19) : (var_1_18 + var_1_19)))))) : (var_1_16 == ((double) ((((var_1_18) > (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10))))) ? (var_1_18) : (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10)))))))))) && ((((((last_1_var_1_34) < ((last_1_var_1_6 % var_1_8))) ? (last_1_var_1_34) : ((last_1_var_1_6 % var_1_8)))) >= last_1_var_1_1) ? (var_1_20 == ((unsigned char) (var_1_5 + ((((16) < (1)) ? (16) : (1)))))) : 1)) && (var_1_21 == ((signed long int) ((256 + (var_1_8 + var_1_5)) - var_1_6)))) && (var_1_22 == ((unsigned char) (! (var_1_15 || (! var_1_23)))))) && (((var_1_17 / 31.375f) < 100.25) ? (var_1_24 == ((float) (var_1_25 + 128.6f))) : 1)) && (var_1_14 ? (var_1_26 == ((signed char) (var_1_5 - (var_1_27 - (var_1_28 - var_1_29))))) : (var_1_15 ? (var_1_26 == ((signed char) (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - ((((var_1_5) > (var_1_29)) ? (var_1_5) : (var_1_29)))))) : 1))) && (var_1_30 == ((unsigned char) (var_1_12 || (var_1_23 && (var_1_12 || var_1_31)))))) && ((var_1_20 < (var_1_20 + var_1_6)) ? (var_1_32 == ((signed long int) (var_1_34 + var_1_5))) : (var_1_32 == ((signed long int) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) - 16))))) && ((! (((((last_1_var_1_6) > (last_1_var_1_36)) ? (last_1_var_1_6) : (last_1_var_1_36))) > (var_1_29 >> var_1_5))) ? ((last_1_var_1_16 <= var_1_19) ? (var_1_34 == ((signed short int) ((((((var_1_28 - var_1_5)) > (var_1_8)) ? ((var_1_28 - var_1_5)) : (var_1_8))) + last_1_var_1_32))) : 1) : (var_1_34 == ((signed short int) var_1_29))) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L192-L193] return (((((((((((((((var_1_36 >= var_1_21) || var_1_22) ? ((((var_1_36 * var_1_21) >> var_1_5) >= 50u) ? (var_1_1 == ((unsigned long int) var_1_5)) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_5))) && ((var_1_5 >= ((((last_1_var_1_20) > (last_1_var_1_1)) ? (last_1_var_1_20) : (last_1_var_1_1)))) ? ((((((var_1_5) > (last_1_var_1_1)) ? (var_1_5) : (last_1_var_1_1))) > (last_1_var_1_36 / var_1_7)) ? (var_1_6 == ((unsigned char) (var_1_5 + 32))) : (var_1_6 == ((unsigned char) (var_1_8 - var_1_5)))) : (var_1_6 == ((unsigned char) var_1_5)))) && (var_1_9 == ((double) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11)))))) && (var_1_12 == ((unsigned char) (var_1_13 || (var_1_14 || var_1_15))))) && ((var_1_20 < 1u) ? ((! (var_1_7 >= var_1_5)) ? ((var_1_20 < (var_1_7 * var_1_1)) ? (var_1_16 == ((double) 31.6)) : (var_1_16 == ((double) (var_1_17 - ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))))) : (var_1_16 == ((double) ((((var_1_18 + var_1_19) < 0 ) ? -(var_1_18 + var_1_19) : (var_1_18 + var_1_19)))))) : (var_1_16 == ((double) ((((var_1_18) > (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10))))) ? (var_1_18) : (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10)))))))))) && ((((((last_1_var_1_34) < ((last_1_var_1_6 % var_1_8))) ? (last_1_var_1_34) : ((last_1_var_1_6 % var_1_8)))) >= last_1_var_1_1) ? (var_1_20 == ((unsigned char) (var_1_5 + ((((16) < (1)) ? (16) : (1)))))) : 1)) && (var_1_21 == ((signed long int) ((256 + (var_1_8 + var_1_5)) - var_1_6)))) && (var_1_22 == ((unsigned char) (! (var_1_15 || (! var_1_23)))))) && (((var_1_17 / 31.375f) < 100.25) ? (var_1_24 == ((float) (var_1_25 + 128.6f))) : 1)) && (var_1_14 ? (var_1_26 == ((signed char) (var_1_5 - (var_1_27 - (var_1_28 - var_1_29))))) : (var_1_15 ? (var_1_26 == ((signed char) (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - ((((var_1_5) > (var_1_29)) ? (var_1_5) : (var_1_29)))))) : 1))) && (var_1_30 == ((unsigned char) (var_1_12 || (var_1_23 && (var_1_12 || var_1_31)))))) && ((var_1_20 < (var_1_20 + var_1_6)) ? (var_1_32 == ((signed long int) (var_1_34 + var_1_5))) : (var_1_32 == ((signed long int) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) - 16))))) && ((! (((((last_1_var_1_6) > (last_1_var_1_36)) ? (last_1_var_1_6) : (last_1_var_1_36))) > (var_1_29 >> var_1_5))) ? ((last_1_var_1_16 <= var_1_19) ? (var_1_34 == ((signed short int) ((((((var_1_28 - var_1_5)) > (var_1_8)) ? ((var_1_28 - var_1_5)) : (var_1_8))) + last_1_var_1_32))) : 1) : (var_1_34 == ((signed short int) var_1_29)))) && (var_1_36 == ((unsigned char) var_1_5)) ; [L202] RET, EXPR property() [L202] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_34=0, var_1_36=0, var_1_5=0, var_1_6=254, var_1_7=65, var_1_8=254, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1625 mSDsluCounter, 3748 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2609 mSDsCounter, 641 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2282 IncrementalHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 641 mSolverCounterUnsat, 1139 mSDtfsCounter, 2282 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2323 GetRequests, 2196 SyntacticMatches, 4 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=9, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 268 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 3149 NumberOfCodeBlocks, 3149 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3123 ConstructedInterpolants, 11 QuantifiedInterpolants, 12956 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2413 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 25279/25984 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-10 07:15:03,563 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-while_file-45.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 c1eefa48d2d2d0e0297fcc2acb2c6cc9c9e34b949fc6fbd7ce865e72d2e07400 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:15:05,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:15:05,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:15:05,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:15:05,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:15:05,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:15:05,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:15:05,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:15:05,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:15:05,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:15:05,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:15:05,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:15:05,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:15:05,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:15:05,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:15:05,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:15:05,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:15:05,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:15:05,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:15:05,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:15:05,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:15:05,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:15:05,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:15:05,824 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:15:05,825 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:15:05,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:15:05,825 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:15:05,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:15:05,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:15:05,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:15:05,826 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:15:05,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:15:05,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:15:05,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:15:05,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:15:05,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:15:05,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:15:05,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:15:05,829 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:15:05,830 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:15:05,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:15:05,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:15:05,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:15:05,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:15:05,831 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 -> c1eefa48d2d2d0e0297fcc2acb2c6cc9c9e34b949fc6fbd7ce865e72d2e07400 [2024-11-10 07:15:06,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:15:06,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:15:06,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:15:06,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:15:06,181 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:15:06,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-45.i [2024-11-10 07:15:07,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:15:07,943 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:15:07,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-45.i [2024-11-10 07:15:07,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856d0cae8/338d3e37611d4b4386e269986dc8c813/FLAG082a44b72 [2024-11-10 07:15:08,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856d0cae8/338d3e37611d4b4386e269986dc8c813 [2024-11-10 07:15:08,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:15:08,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:15:08,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:15:08,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:15:08,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:15:08,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9cee88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08, skipping insertion in model container [2024-11-10 07:15:08,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:15:08,533 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-while_file-45.i[916,929] [2024-11-10 07:15:08,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:15:08,662 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:15:08,676 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-while_file-45.i[916,929] [2024-11-10 07:15:08,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:15:08,752 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:15:08,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08 WrapperNode [2024-11-10 07:15:08,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:15:08,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:15:08,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:15:08,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:15:08,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,822 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-10 07:15:08,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:15:08,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:15:08,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:15:08,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:15:08,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,878 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-10 07:15:08,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:15:08,911 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:15:08,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:15:08,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:15:08,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (1/1) ... [2024-11-10 07:15:08,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:15:08,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:15:08,940 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-10 07:15:08,942 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-10 07:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:15:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:15:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:15:09,070 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:15:09,073 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:15:18,584 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 07:15:18,585 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:15:18,596 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:15:18,597 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:15:18,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:15:18 BoogieIcfgContainer [2024-11-10 07:15:18,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:15:18,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:15:18,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:15:18,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:15:18,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:15:08" (1/3) ... [2024-11-10 07:15:18,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0e8f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:15:18, skipping insertion in model container [2024-11-10 07:15:18,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:15:08" (2/3) ... [2024-11-10 07:15:18,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0e8f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:15:18, skipping insertion in model container [2024-11-10 07:15:18,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:15:18" (3/3) ... [2024-11-10 07:15:18,606 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-45.i [2024-11-10 07:15:18,623 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:15:18,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:15:18,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:15:18,698 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;@5b9eaca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:15:18,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:15:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 07:15:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 07:15:18,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:15:18,719 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:15:18,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:15:18,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:15:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash 704311551, now seen corresponding path program 1 times [2024-11-10 07:15:18,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:15:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504780493] [2024-11-10 07:15:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:18,737 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-10 07:15:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:15:18,739 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-10 07:15:18,754 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-10 07:15:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:15:19,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:15:19,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:15:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-10 07:15:19,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:15:19,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:15:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504780493] [2024-11-10 07:15:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504780493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:15:19,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:15:19,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:15:19,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967422355] [2024-11-10 07:15:19,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:15:19,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:15:19,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:15:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:15:19,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:15:19,455 INFO L87 Difference]: Start difference. First operand has 88 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 07:15:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:15:19,495 INFO L93 Difference]: Finished difference Result 168 states and 288 transitions. [2024-11-10 07:15:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:15:19,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-11-10 07:15:19,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:15:19,507 INFO L225 Difference]: With dead ends: 168 [2024-11-10 07:15:19,507 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 07:15:19,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-10 07:15:19,520 INFO L432 NwaCegarLoop]: 125 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, 125 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-10 07:15:19,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:15:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 07:15:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-10 07:15:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 07:15:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2024-11-10 07:15:19,582 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 187 [2024-11-10 07:15:19,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:15:19,583 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2024-11-10 07:15:19,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 07:15:19,584 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2024-11-10 07:15:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 07:15:19,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:15:19,590 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:15:19,614 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-10 07:15:19,791 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-10 07:15:19,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:15:19,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:15:19,793 INFO L85 PathProgramCache]: Analyzing trace with hash -213848034, now seen corresponding path program 1 times [2024-11-10 07:15:19,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:15:19,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837172776] [2024-11-10 07:15:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:19,795 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-10 07:15:19,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:15:19,797 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-10 07:15:19,799 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-10 07:15:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:15:20,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 07:15:20,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:15:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:15:26,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:15:26,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:15:26,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837172776] [2024-11-10 07:15:26,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837172776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:15:26,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:15:26,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:15:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882892734] [2024-11-10 07:15:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:15:26,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:15:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:15:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:15:26,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:15:26,604 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:15:31,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:15:35,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:15:39,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:15:41,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:15:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:15:41,012 INFO L93 Difference]: Finished difference Result 245 states and 371 transitions. [2024-11-10 07:15:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:15:41,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-10 07:15:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:15:41,079 INFO L225 Difference]: With dead ends: 245 [2024-11-10 07:15:41,080 INFO L226 Difference]: Without dead ends: 165 [2024-11-10 07:15:41,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:15:41,082 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 66 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 60 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:15:41,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 342 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 26 Invalid, 3 Unknown, 0 Unchecked, 14.3s Time] [2024-11-10 07:15:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-10 07:15:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2024-11-10 07:15:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 states have internal predecessors, (98), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:15:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 214 transitions. [2024-11-10 07:15:41,113 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 214 transitions. Word has length 187 [2024-11-10 07:15:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:15:41,114 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 214 transitions. [2024-11-10 07:15:41,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:15:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 214 transitions. [2024-11-10 07:15:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-10 07:15:41,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:15:41,118 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:15:41,140 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-10 07:15:41,321 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-10 07:15:41,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:15:41,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:15:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash 645183207, now seen corresponding path program 1 times [2024-11-10 07:15:41,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:15:41,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454431650] [2024-11-10 07:15:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:15:41,324 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-10 07:15:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:15:41,327 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-10 07:15:41,328 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-10 07:15:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:15:41,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:15:41,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:15:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 820 proven. 48 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2024-11-10 07:15:43,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:15:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:15:45,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:15:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454431650] [2024-11-10 07:15:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454431650] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:15:45,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:15:45,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 07:15:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164123778] [2024-11-10 07:15:45,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:15:45,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:15:45,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:15:45,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:15:45,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:15:45,438 INFO L87 Difference]: Start difference. First operand 142 states and 214 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46)