./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.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 9e515de62df857d489d59950c6beb84861229f7c018feb1ce9e167b3b2d6609e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:35:33,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:35:33,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:35:33,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:35:33,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:35:33,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:35:33,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:35:33,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:35:33,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:35:33,196 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:35:33,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:35:33,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:35:33,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:35:33,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:35:33,201 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:35:33,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:35:33,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:35:33,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:35:33,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:35:33,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:35:33,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:35:33,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:35:33,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:35:33,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:35:33,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:35:33,208 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:35:33,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:35:33,209 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:35:33,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:35:33,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:35:33,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:35:33,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:35:33,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:35:33,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:35:33,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:35:33,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:35:33,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:35:33,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:35:33,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:35:33,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:35:33,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:35:33,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:35:33,213 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 -> 9e515de62df857d489d59950c6beb84861229f7c018feb1ce9e167b3b2d6609e [2024-11-08 23:35:33,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:35:33,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:35:33,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:35:33,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:35:33,486 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:35:33,487 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-80.i [2024-11-08 23:35:34,911 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:35:35,146 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:35:35,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i [2024-11-08 23:35:35,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3d009ec/d0f59efae64442809a84d5ebd3bb9d36/FLAG00b7338cf [2024-11-08 23:35:35,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3d009ec/d0f59efae64442809a84d5ebd3bb9d36 [2024-11-08 23:35:35,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:35:35,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:35:35,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:35:35,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:35:35,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:35:35,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5850cf78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35, skipping insertion in model container [2024-11-08 23:35:35,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:35:35,462 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-80.i[916,929] [2024-11-08 23:35:35,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:35:35,553 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:35:35,566 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-80.i[916,929] [2024-11-08 23:35:35,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:35:35,629 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:35:35,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35 WrapperNode [2024-11-08 23:35:35,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:35:35,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:35:35,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:35:35,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:35:35,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,716 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2024-11-08 23:35:35,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:35:35,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:35:35,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:35:35,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:35:35,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,760 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:35:35,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:35:35,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:35:35,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:35:35,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:35:35,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (1/1) ... [2024-11-08 23:35:35,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:35:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:35,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:35:35,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:35:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:35:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:35:35,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:35:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:35:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:35:35,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:35:35,952 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:35:35,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:35:36,378 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-08 23:35:36,379 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:35:36,393 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:35:36,393 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:35:36,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:35:36 BoogieIcfgContainer [2024-11-08 23:35:36,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:35:36,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:35:36,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:35:36,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:35:36,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:35:35" (1/3) ... [2024-11-08 23:35:36,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7032a694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:35:36, skipping insertion in model container [2024-11-08 23:35:36,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:35" (2/3) ... [2024-11-08 23:35:36,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7032a694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:35:36, skipping insertion in model container [2024-11-08 23:35:36,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:35:36" (3/3) ... [2024-11-08 23:35:36,404 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-80.i [2024-11-08 23:35:36,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:35:36,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:35:36,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:35:36,501 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;@191bbaf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:35:36,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:35:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 78 states have internal predecessors, (114), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:35:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 23:35:36,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:36,519 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:36,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:36,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1673297695, now seen corresponding path program 1 times [2024-11-08 23:35:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:36,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407658071] [2024-11-08 23:35:36,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:36,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:35:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:35:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:35:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:35:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:35:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:35:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:35:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 23:35:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:35:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:35:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:35:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 23:35:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:35:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 23:35:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:35:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 23:35:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:35:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:35:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:35:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:35:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:35:37,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:37,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407658071] [2024-11-08 23:35:37,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407658071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:37,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:37,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:35:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282216045] [2024-11-08 23:35:37,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:37,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:35:37,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:37,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:35:37,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:35:37,038 INFO L87 Difference]: Start difference. First operand has 103 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 78 states have internal predecessors, (114), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:35:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:37,076 INFO L93 Difference]: Finished difference Result 199 states and 337 transitions. [2024-11-08 23:35:37,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:35:37,079 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 161 [2024-11-08 23:35:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:37,110 INFO L225 Difference]: With dead ends: 199 [2024-11-08 23:35:37,110 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 23:35:37,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:35:37,126 INFO L432 NwaCegarLoop]: 153 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, 153 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:37,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:35:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 23:35:37,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-08 23:35:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:35:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2024-11-08 23:35:37,195 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 161 [2024-11-08 23:35:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:37,196 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2024-11-08 23:35:37,196 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:35:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2024-11-08 23:35:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 23:35:37,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:37,200 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:37,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:35:37,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:37,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash -450312811, now seen corresponding path program 1 times [2024-11-08 23:35:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:37,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067925661] [2024-11-08 23:35:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:37,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:35:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:35:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:35:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:35:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:35:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:35:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:35:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 23:35:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:35:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:35:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:35:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 23:35:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:35:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 23:35:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:35:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 23:35:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:35:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:35:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:35:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:35:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:35:37,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067925661] [2024-11-08 23:35:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067925661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:37,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:35:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566862926] [2024-11-08 23:35:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:37,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:35:37,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:37,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:35:37,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:35:37,546 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:35:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:37,610 INFO L93 Difference]: Finished difference Result 245 states and 376 transitions. [2024-11-08 23:35:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:35:37,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2024-11-08 23:35:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:37,613 INFO L225 Difference]: With dead ends: 245 [2024-11-08 23:35:37,613 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 23:35:37,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:35:37,618 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 77 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:37,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 270 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:35:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 23:35:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-08 23:35:37,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 119 states have internal predecessors, (171), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 23:35:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2024-11-08 23:35:37,639 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 161 [2024-11-08 23:35:37,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:37,640 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2024-11-08 23:35:37,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:35:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2024-11-08 23:35:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 23:35:37,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:37,644 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:37,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:35:37,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:37,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash 691721377, now seen corresponding path program 1 times [2024-11-08 23:35:37,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904801937] [2024-11-08 23:35:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:35:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:35:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:35:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:35:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:35:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:35:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:35:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 23:35:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:35:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:35:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:35:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 23:35:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:35:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 23:35:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:35:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 23:35:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:35:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:35:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:35:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:35:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:35:38,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:38,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904801937] [2024-11-08 23:35:38,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904801937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:38,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:38,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:35:38,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969761646] [2024-11-08 23:35:38,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:38,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:35:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:38,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:35:38,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:35:38,845 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:35:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:40,014 INFO L93 Difference]: Finished difference Result 582 states and 882 transitions. [2024-11-08 23:35:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:35:40,015 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-11-08 23:35:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:40,025 INFO L225 Difference]: With dead ends: 582 [2024-11-08 23:35:40,025 INFO L226 Difference]: Without dead ends: 439 [2024-11-08 23:35:40,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-08 23:35:40,027 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 589 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:40,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1097 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 23:35:40,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-08 23:35:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 237. [2024-11-08 23:35:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 183 states have (on average 1.4316939890710383) internal successors, (262), 184 states have internal predecessors, (262), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:35:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 358 transitions. [2024-11-08 23:35:40,076 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 358 transitions. Word has length 162 [2024-11-08 23:35:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:40,077 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 358 transitions. [2024-11-08 23:35:40,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:35:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 358 transitions. [2024-11-08 23:35:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 23:35:40,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:40,083 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:35:40,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:40,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash 182248287, now seen corresponding path program 1 times [2024-11-08 23:35:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:40,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162405645] [2024-11-08 23:35:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:40,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:35:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:35:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:35:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:35:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:35:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:35:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:35:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 23:35:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:35:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:35:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:35:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 23:35:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:35:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 23:35:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:35:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 23:35:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:35:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:35:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:35:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:35:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:35:40,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:40,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162405645] [2024-11-08 23:35:40,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162405645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:40,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:40,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:35:40,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880898749] [2024-11-08 23:35:40,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:40,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:35:40,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:40,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:35:40,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:35:40,896 INFO L87 Difference]: Start difference. First operand 237 states and 358 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:35:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:42,692 INFO L93 Difference]: Finished difference Result 694 states and 1050 transitions. [2024-11-08 23:35:42,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 23:35:42,693 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-11-08 23:35:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:42,696 INFO L225 Difference]: With dead ends: 694 [2024-11-08 23:35:42,699 INFO L226 Difference]: Without dead ends: 551 [2024-11-08 23:35:42,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-08 23:35:42,700 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 529 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:42,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1561 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 23:35:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-08 23:35:42,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 237. [2024-11-08 23:35:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 183 states have (on average 1.4316939890710383) internal successors, (262), 184 states have internal predecessors, (262), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:35:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 358 transitions. [2024-11-08 23:35:42,753 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 358 transitions. Word has length 162 [2024-11-08 23:35:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:42,755 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 358 transitions. [2024-11-08 23:35:42,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:35:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 358 transitions. [2024-11-08 23:35:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 23:35:42,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:42,758 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:42,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:35:42,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:42,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash -986425596, now seen corresponding path program 1 times [2024-11-08 23:35:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:42,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658812549] [2024-11-08 23:35:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:35:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:35:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:35:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:35:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:35:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:35:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:35:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 23:35:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:35:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:35:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:35:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 23:35:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:35:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 23:35:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:35:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 23:35:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:35:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:35:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:35:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:35:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:35:43,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:43,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658812549] [2024-11-08 23:35:43,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658812549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:43,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:43,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:35:43,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340499327] [2024-11-08 23:35:43,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:43,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:35:43,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:43,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:35:43,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:35:43,486 INFO L87 Difference]: Start difference. First operand 237 states and 358 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:35:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:44,255 INFO L93 Difference]: Finished difference Result 545 states and 829 transitions. [2024-11-08 23:35:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:35:44,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 163 [2024-11-08 23:35:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:44,258 INFO L225 Difference]: With dead ends: 545 [2024-11-08 23:35:44,258 INFO L226 Difference]: Without dead ends: 402 [2024-11-08 23:35:44,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-08 23:35:44,260 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 618 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:44,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 905 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:35:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-08 23:35:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 272. [2024-11-08 23:35:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 218 states have (on average 1.463302752293578) internal successors, (319), 219 states have internal predecessors, (319), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:35:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 415 transitions. [2024-11-08 23:35:44,286 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 415 transitions. Word has length 163 [2024-11-08 23:35:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:44,287 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 415 transitions. [2024-11-08 23:35:44,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:35:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 415 transitions. [2024-11-08 23:35:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 23:35:44,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:44,289 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:44,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:35:44,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:44,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:44,290 INFO L85 PathProgramCache]: Analyzing trace with hash 354724942, now seen corresponding path program 1 times [2024-11-08 23:35:44,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974258886] [2024-11-08 23:35:44,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:35:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:35:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:35:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:35:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:35:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:35:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:35:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 23:35:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:35:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:35:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:35:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 23:35:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:35:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 23:35:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:35:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 23:35:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:35:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:35:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:35:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:35:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:35:44,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:44,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974258886] [2024-11-08 23:35:44,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974258886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:35:44,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402896090] [2024-11-08 23:35:44,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:44,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:44,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:44,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:35:44,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:35:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:44,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:35:44,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-08 23:35:44,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:35:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:35:45,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402896090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:35:45,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:35:45,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 23:35:45,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729824899] [2024-11-08 23:35:45,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:35:45,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:35:45,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:45,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:35:45,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:35:45,210 INFO L87 Difference]: Start difference. First operand 272 states and 415 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-08 23:35:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:45,409 INFO L93 Difference]: Finished difference Result 492 states and 747 transitions. [2024-11-08 23:35:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:35:45,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 163 [2024-11-08 23:35:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:45,413 INFO L225 Difference]: With dead ends: 492 [2024-11-08 23:35:45,413 INFO L226 Difference]: Without dead ends: 281 [2024-11-08 23:35:45,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:35:45,415 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 78 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:45,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 339 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:35:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-08 23:35:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2024-11-08 23:35:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 221 states have (on average 1.411764705882353) internal successors, (312), 222 states have internal predecessors, (312), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:35:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 408 transitions. [2024-11-08 23:35:45,447 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 408 transitions. Word has length 163 [2024-11-08 23:35:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:45,447 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 408 transitions. [2024-11-08 23:35:45,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-08 23:35:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 408 transitions. [2024-11-08 23:35:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 23:35:45,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:45,458 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:45,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:35:45,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 23:35:45,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:45,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1270070702, now seen corresponding path program 1 times [2024-11-08 23:35:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:45,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768026552] [2024-11-08 23:35:45,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:45,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:35:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:35:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:35:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:35:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:35:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:35:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:35:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 23:35:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:35:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:35:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:35:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 23:35:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:35:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 23:35:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:35:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 23:35:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:35:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:35:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:35:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:35:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:35:45,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:45,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768026552] [2024-11-08 23:35:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768026552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:35:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163656690] [2024-11-08 23:35:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:45,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:45,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:45,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:35:45,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:35:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:46,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:35:46,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 186 proven. 60 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-08 23:35:46,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:35:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:35:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163656690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:35:46,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:35:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 23:35:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459814943] [2024-11-08 23:35:46,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:35:46,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:35:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:46,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:35:46,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:35:46,553 INFO L87 Difference]: Start difference. First operand 277 states and 408 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-08 23:35:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:46,753 INFO L93 Difference]: Finished difference Result 427 states and 620 transitions. [2024-11-08 23:35:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:35:46,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 163 [2024-11-08 23:35:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:46,757 INFO L225 Difference]: With dead ends: 427 [2024-11-08 23:35:46,758 INFO L226 Difference]: Without dead ends: 213 [2024-11-08 23:35:46,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:35:46,759 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 82 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:46,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 287 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:35:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-08 23:35:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2024-11-08 23:35:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 23:35:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 291 transitions. [2024-11-08 23:35:46,789 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 291 transitions. Word has length 163 [2024-11-08 23:35:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:46,790 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 291 transitions. [2024-11-08 23:35:46,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-08 23:35:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 291 transitions. [2024-11-08 23:35:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:35:46,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:46,792 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:46,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:35:46,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 23:35:46,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:46,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash -530368202, now seen corresponding path program 1 times [2024-11-08 23:35:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047887383] [2024-11-08 23:35:46,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:35:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:35:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:35:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:35:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:35:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:35:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:35:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:35:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:35:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:35:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 23:35:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:35:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:35:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:35:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 23:35:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:35:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 23:35:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:35:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 23:35:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:35:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:35:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:35:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:35:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 114 proven. 12 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-08 23:35:47,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:35:47,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047887383] [2024-11-08 23:35:47,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047887383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:35:47,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851113488] [2024-11-08 23:35:47,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:47,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:47,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:47,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:35:47,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:35:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:47,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 23:35:47,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 411 proven. 12 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-08 23:35:47,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:35:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-08 23:35:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851113488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:35:48,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:35:48,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-08 23:35:48,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178211546] [2024-11-08 23:35:48,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:35:48,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 23:35:48,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:35:48,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 23:35:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:35:48,342 INFO L87 Difference]: Start difference. First operand 209 states and 291 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 23:35:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:48,974 INFO L93 Difference]: Finished difference Result 464 states and 629 transitions. [2024-11-08 23:35:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 23:35:48,975 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 165 [2024-11-08 23:35:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:48,978 INFO L225 Difference]: With dead ends: 464 [2024-11-08 23:35:48,978 INFO L226 Difference]: Without dead ends: 355 [2024-11-08 23:35:48,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 23:35:48,980 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 472 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:48,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 577 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:35:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-08 23:35:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 227. [2024-11-08 23:35:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 167 states have (on average 1.2754491017964071) internal successors, (213), 167 states have internal predecessors, (213), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 23:35:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 305 transitions. [2024-11-08 23:35:49,010 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 305 transitions. Word has length 165 [2024-11-08 23:35:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:49,013 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 305 transitions. [2024-11-08 23:35:49,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 23:35:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 305 transitions. [2024-11-08 23:35:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:35:49,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:49,015 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:49,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 23:35:49,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:49,220 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:49,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1810231880, now seen corresponding path program 1 times [2024-11-08 23:35:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:35:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039703367] [2024-11-08 23:35:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:35:49,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1442662334] [2024-11-08 23:35:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:49,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:49,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:49,341 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-08 23:35:49,343 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-08 23:35:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:35:49,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:35:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:35:49,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:35:49,726 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:35:49,728 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:35:49,748 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-08 23:35:49,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:35:49,934 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:35:50,059 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:35:50,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:35:50 BoogieIcfgContainer [2024-11-08 23:35:50,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:35:50,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:35:50,063 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:35:50,063 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:35:50,063 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:35:36" (3/4) ... [2024-11-08 23:35:50,065 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:35:50,066 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:35:50,067 INFO L158 Benchmark]: Toolchain (without parser) took 14873.80ms. Allocated memory was 138.4MB in the beginning and 272.6MB in the end (delta: 134.2MB). Free memory was 67.7MB in the beginning and 208.9MB in the end (delta: -141.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:35:50,067 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 138.4MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:35:50,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.05ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 67.6MB in the beginning and 147.4MB in the end (delta: -79.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-08 23:35:50,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.23ms. Allocated memory is still 184.5MB. Free memory was 147.4MB in the beginning and 143.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:35:50,068 INFO L158 Benchmark]: Boogie Preprocessor took 80.45ms. Allocated memory is still 184.5MB. Free memory was 143.2MB in the beginning and 136.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:35:50,068 INFO L158 Benchmark]: RCFGBuilder took 595.22ms. Allocated memory is still 184.5MB. Free memory was 136.9MB in the beginning and 106.5MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 23:35:50,069 INFO L158 Benchmark]: TraceAbstraction took 13666.01ms. Allocated memory was 184.5MB in the beginning and 272.6MB in the end (delta: 88.1MB). Free memory was 105.5MB in the beginning and 208.9MB in the end (delta: -103.4MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2024-11-08 23:35:50,069 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 272.6MB. Free memory is still 208.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:35:50,070 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.18ms. Allocated memory is still 138.4MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.05ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 67.6MB in the beginning and 147.4MB in the end (delta: -79.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.23ms. Allocated memory is still 184.5MB. Free memory was 147.4MB in the beginning and 143.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.45ms. Allocated memory is still 184.5MB. Free memory was 143.2MB in the beginning and 136.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 595.22ms. Allocated memory is still 184.5MB. Free memory was 136.9MB in the beginning and 106.5MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13666.01ms. Allocated memory was 184.5MB in the beginning and 272.6MB in the end (delta: 88.1MB). Free memory was 105.5MB in the beginning and 208.9MB in the end (delta: -103.4MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 272.6MB. Free memory is still 208.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryArithmeticDOUBLEoperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryArithmeticFLOAToperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.8; [L23] float var_1_6 = 16.375; [L24] float var_1_7 = 0.25; [L25] unsigned char var_1_8 = 1; [L26] unsigned char var_1_9 = 1; [L27] unsigned char var_1_10 = 0; [L28] unsigned long int var_1_11 = 128; [L29] double var_1_13 = 255.5; [L30] double var_1_14 = 0.0; [L31] double var_1_15 = 0.0; [L32] double var_1_16 = 100.3; [L33] unsigned long int var_1_17 = 32; [L34] unsigned short int var_1_19 = 100; [L35] double var_1_21 = 10000000000.5; [L36] double var_1_22 = 32.2; [L37] signed short int var_1_23 = -2; [L38] signed char var_1_24 = 32; [L39] signed char var_1_25 = 10; [L40] signed char var_1_26 = -128; [L41] double var_1_27 = 5.8; [L42] unsigned short int var_1_28 = 16; [L43] unsigned char var_1_30 = 1; [L44] unsigned char var_1_31 = 0; [L45] unsigned char var_1_32 = 0; [L46] unsigned long int var_1_33 = 256; [L47] unsigned char var_1_34 = 0; [L48] float var_1_35 = 3.625; [L49] float var_1_36 = 9.8; [L50] unsigned char var_1_37 = 4; [L51] unsigned long int last_1_var_1_17 = 32; [L52] double last_1_var_1_22 = 32.2; [L53] double last_1_var_1_27 = 5.8; [L54] unsigned char last_1_var_1_37 = 4; VAL [isInitial=0, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L182] last_1_var_1_17 = var_1_17 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_27 = var_1_27 [L185] last_1_var_1_37 = var_1_37 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L146] var_1_7 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L154] var_1_14 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L156] var_1_15 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L158] var_1_16 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L160] var_1_24 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L161] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L163] var_1_25 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L164] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L166] var_1_26 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L167] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L171] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L173] var_1_33 = __VERIFIER_nondet_ulong() [L174] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L174] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] CALL assume_abort_if_not(var_1_33 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] RET assume_abort_if_not(var_1_33 <= 4294967295) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L177] var_1_34 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L196] RET updateVariables() [L197] CALL step() [L58] COND TRUE (- last_1_var_1_27) < var_1_7 [L59] var_1_21 = 0.19999999999999996 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L63] COND TRUE ((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16) [L64] var_1_28 = ((var_1_25 + (100 + 64)) + last_1_var_1_37) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L68] COND TRUE \read(var_1_9) [L69] var_1_11 = 0u VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L79] COND TRUE \read(var_1_9) [L80] var_1_30 = (! var_1_31) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L82] var_1_35 = var_1_16 [L83] var_1_36 = var_1_14 [L84] var_1_37 = var_1_25 [L85] unsigned long int stepLocal_0 = 1u; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L86] COND FALSE !(((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L91] signed long int stepLocal_4 = (var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4))); VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_4=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L92] COND TRUE stepLocal_4 > var_1_37 [L93] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L95] unsigned char stepLocal_3 = var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_3=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L96] COND FALSE !(var_1_28 <= stepLocal_3) [L99] var_1_19 = ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L101] signed long int stepLocal_2 = var_1_19 - var_1_19; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L102] COND TRUE \read(var_1_9) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L103] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L104] EXPR (last_1_var_1_17 / -64) << var_1_11 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L104] COND TRUE ((last_1_var_1_17 / -64) << var_1_11) >= stepLocal_2 [L105] var_1_17 = var_1_19 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L113] EXPR var_1_37 ^ (4u / var_1_33) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L113] COND FALSE !((var_1_37 ^ (4u / var_1_33)) != var_1_17) [L116] var_1_32 = (var_1_31 || var_1_34) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L118] COND FALSE !(((var_1_16 * var_1_6) > var_1_15) && var_1_32) [L121] var_1_22 = ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L123] COND TRUE ((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23 [L124] var_1_1 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L126] signed long int stepLocal_5 = var_1_19 + var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L127] COND TRUE var_1_28 != stepLocal_5 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L128] COND TRUE var_1_1 < var_1_21 [L129] var_1_27 = (var_1_15 - var_1_16) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L132] unsigned short int stepLocal_1 = var_1_28; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L133] COND TRUE var_1_7 != (var_1_27 * var_1_6) [L134] var_1_13 = ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR (((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L188] EXPR (((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34)))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L188-L189] return ((((((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34))))) && (var_1_35 == ((float) var_1_16))) && (var_1_36 == ((float) var_1_14))) && (var_1_37 == ((unsigned char) var_1_25)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-1, var_1_24=-1, var_1_25=0, var_1_26=-1, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 9, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2469 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2445 mSDsluCounter, 5189 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3920 mSDsCounter, 714 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3210 IncrementalHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 714 mSolverCounterUnsat, 1269 mSDtfsCounter, 3210 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1476 GetRequests, 1375 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=6, InterpolantAutomatonStates: 78, 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, 8 MinimizatonAttempts, 785 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2121 NumberOfCodeBlocks, 2121 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2268 ConstructedInterpolants, 0 QuantifiedInterpolants, 8021 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1200 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 13787/14168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:35:50,118 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-80.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 9e515de62df857d489d59950c6beb84861229f7c018feb1ce9e167b3b2d6609e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:35:52,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:35:52,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:35:52,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:35:52,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:35:52,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:35:52,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:35:52,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:35:52,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:35:52,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:35:52,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:35:52,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:35:52,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:35:52,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:35:52,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:35:52,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:35:52,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:35:52,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:35:52,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:35:52,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:35:52,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:35:52,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:35:52,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:35:52,413 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:35:52,413 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:35:52,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:35:52,414 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:35:52,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:35:52,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:35:52,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:35:52,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:35:52,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:35:52,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:35:52,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:35:52,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:35:52,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:35:52,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:35:52,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:35:52,419 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:35:52,420 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:35:52,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:35:52,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:35:52,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:35:52,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:35:52,421 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 -> 9e515de62df857d489d59950c6beb84861229f7c018feb1ce9e167b3b2d6609e [2024-11-08 23:35:52,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:35:52,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:35:52,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:35:52,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:35:52,815 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:35:52,817 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-80.i [2024-11-08 23:35:54,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:35:54,754 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:35:54,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-80.i [2024-11-08 23:35:54,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a99df3ddb/107a416bcc654e09b5c0d6f99e62f2d2/FLAG5153c54aa [2024-11-08 23:35:54,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a99df3ddb/107a416bcc654e09b5c0d6f99e62f2d2 [2024-11-08 23:35:54,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:35:54,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:35:54,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:35:54,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:35:54,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:35:54,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:35:54" (1/1) ... [2024-11-08 23:35:54,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508ef9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:54, skipping insertion in model container [2024-11-08 23:35:54,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:35:54" (1/1) ... [2024-11-08 23:35:54,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:35:55,017 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-80.i[916,929] [2024-11-08 23:35:55,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:35:55,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:35:55,154 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-80.i[916,929] [2024-11-08 23:35:55,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:35:55,234 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:35:55,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55 WrapperNode [2024-11-08 23:35:55,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:35:55,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:35:55,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:35:55,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:35:55,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,297 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-08 23:35:55,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:35:55,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:35:55,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:35:55,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:35:55,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,338 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:35:55,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:35:55,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:35:55,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:35:55,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:35:55,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (1/1) ... [2024-11-08 23:35:55,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:35:55,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:35:55,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:35:55,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:35:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:35:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:35:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:35:55,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:35:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:35:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:35:55,559 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:35:55,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:36:17,123 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 23:36:17,124 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:36:17,137 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:36:17,137 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:36:17,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:36:17 BoogieIcfgContainer [2024-11-08 23:36:17,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:36:17,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:36:17,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:36:17,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:36:17,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:35:54" (1/3) ... [2024-11-08 23:36:17,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76dffb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:36:17, skipping insertion in model container [2024-11-08 23:36:17,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:35:55" (2/3) ... [2024-11-08 23:36:17,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76dffb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:36:17, skipping insertion in model container [2024-11-08 23:36:17,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:36:17" (3/3) ... [2024-11-08 23:36:17,145 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-80.i [2024-11-08 23:36:17,158 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:36:17,158 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:36:17,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:36:17,230 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;@2f4a9ca4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:36:17,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:36:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:36:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:36:17,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:17,252 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:36:17,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:17,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash -679269858, now seen corresponding path program 1 times [2024-11-08 23:36:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:36:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070705073] [2024-11-08 23:36:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:17,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:17,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:36:17,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:36:17,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:36:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:18,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:36:18,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:36:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-08 23:36:18,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:36:18,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:36:18,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070705073] [2024-11-08 23:36:18,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070705073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:36:18,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:36:18,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:36:18,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434882699] [2024-11-08 23:36:18,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:36:18,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:36:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:36:18,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:36:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:36:18,251 INFO L87 Difference]: Start difference. First operand has 81 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:36:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:36:18,286 INFO L93 Difference]: Finished difference Result 155 states and 269 transitions. [2024-11-08 23:36:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:36:18,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2024-11-08 23:36:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:36:18,297 INFO L225 Difference]: With dead ends: 155 [2024-11-08 23:36:18,297 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 23:36:18,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:36:18,305 INFO L432 NwaCegarLoop]: 119 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, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:36:18,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:36:18,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 23:36:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 23:36:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:36:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2024-11-08 23:36:18,379 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 156 [2024-11-08 23:36:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:36:18,380 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2024-11-08 23:36:18,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:36:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2024-11-08 23:36:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:36:18,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:18,385 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:36:18,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:36:18,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:18,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:18,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash -728354328, now seen corresponding path program 1 times [2024-11-08 23:36:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:36:18,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181681371] [2024-11-08 23:36:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:18,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:18,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:36:18,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:36:18,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:36:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:19,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:36:19,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:36:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 186 proven. 60 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-08 23:36:23,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:36:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:36:26,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:36:26,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181681371] [2024-11-08 23:36:26,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181681371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:36:26,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:36:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 23:36:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292497794] [2024-11-08 23:36:26,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:36:26,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:36:26,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:36:26,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:36:26,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:36:26,414 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-08 23:36:32,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:36:36,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:36:40,937 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-08 23:36:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:36:40,941 INFO L93 Difference]: Finished difference Result 155 states and 236 transitions. [2024-11-08 23:36:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:36:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 156 [2024-11-08 23:36:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:36:41,052 INFO L225 Difference]: With dead ends: 155 [2024-11-08 23:36:41,052 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 23:36:41,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:36:41,054 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 42 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:36:41,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 201 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 14.2s Time] [2024-11-08 23:36:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 23:36:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-08 23:36:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:36:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-11-08 23:36:41,074 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 156 [2024-11-08 23:36:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:36:41,075 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-11-08 23:36:41,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-08 23:36:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-11-08 23:36:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:36:41,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:36:41,078 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:36:41,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:36:41,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:41,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:36:41,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:36:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash 250339880, now seen corresponding path program 1 times [2024-11-08 23:36:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:36:41,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659086111] [2024-11-08 23:36:41,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:36:41,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:36:41,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:36:41,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:36:41,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:36:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:36:42,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:36:42,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:36:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-08 23:36:45,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:36:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:36:49,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:36:49,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659086111] [2024-11-08 23:36:49,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659086111] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:36:49,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:36:49,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 23:36:49,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578152633] [2024-11-08 23:36:49,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:36:49,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:36:49,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:36:49,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:36:49,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:36:49,171 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-08 23:36:56,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []