./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_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 c5bae18a6d5148994ec4a69a5c5f232077dd8ec272c0cbf3326dd03a9563bb98 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:38:57,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:38:58,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 08:38:58,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:38:58,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:38:58,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:38:58,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:38:58,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:38:58,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:38:58,059 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:38:58,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:38:58,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:38:58,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:38:58,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:38:58,063 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:38:58,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:38:58,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:38:58,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:38:58,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 08:38:58,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:38:58,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:38:58,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:38:58,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:38:58,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:38:58,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:38:58,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:38:58,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:38:58,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:38:58,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:38:58,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:38:58,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:38:58,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:38:58,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:38:58,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:38:58,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:38:58,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:38:58,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 08:38:58,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 08:38:58,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:38:58,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:38:58,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:38:58,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:38:58,073 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 -> c5bae18a6d5148994ec4a69a5c5f232077dd8ec272c0cbf3326dd03a9563bb98 [2024-10-14 08:38:58,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:38:58,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:38:58,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:38:58,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:38:58,343 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:38:58,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-80.i [2024-10-14 08:38:59,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:38:59,982 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:38:59,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-80.i [2024-10-14 08:38:59,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38276b4c0/33b7e251766a4b9d8689ee6fed2b0db4/FLAGac3789a18 [2024-10-14 08:39:00,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38276b4c0/33b7e251766a4b9d8689ee6fed2b0db4 [2024-10-14 08:39:00,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:39:00,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:39:00,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:39:00,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:39:00,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:39:00,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bdf6af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00, skipping insertion in model container [2024-10-14 08:39:00,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:39:00,531 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-80.i[915,928] [2024-10-14 08:39:00,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:39:00,614 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:39:00,625 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-80.i[915,928] [2024-10-14 08:39:00,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:39:00,685 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:39:00,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00 WrapperNode [2024-10-14 08:39:00,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:39:00,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:39:00,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:39:00,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:39:00,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,748 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-10-14 08:39:00,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:39:00,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:39:00,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:39:00,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:39:00,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,788 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-10-14 08:39:00,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:39:00,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:39:00,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:39:00,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:39:00,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (1/1) ... [2024-10-14 08:39:00,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:39:00,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:39:00,912 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-10-14 08:39:00,916 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-10-14 08:39:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:39:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:39:00,961 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:39:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 08:39:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:39:00,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:39:01,055 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:39:01,056 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:39:01,433 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 08:39:01,433 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:39:01,472 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:39:01,474 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:39:01,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:39:01 BoogieIcfgContainer [2024-10-14 08:39:01,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:39:01,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:39:01,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:39:01,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:39:01,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:39:00" (1/3) ... [2024-10-14 08:39:01,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd411ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:39:01, skipping insertion in model container [2024-10-14 08:39:01,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:00" (2/3) ... [2024-10-14 08:39:01,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd411ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:39:01, skipping insertion in model container [2024-10-14 08:39:01,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:39:01" (3/3) ... [2024-10-14 08:39:01,483 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-80.i [2024-10-14 08:39:01,504 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:39:01,504 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:39:01,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:39:01,584 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;@26fe9e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:39:01,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:39:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 53 states have internal predecessors, (73), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:39:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 08:39:01,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:39:01,607 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:39:01,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:39:01,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:39:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash 350793599, now seen corresponding path program 1 times [2024-10-14 08:39:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:39:01,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557709505] [2024-10-14 08:39:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:39:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:39:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:01,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:39:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:01,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 08:39:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:01,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 08:39:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 08:39:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 08:39:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:39:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 08:39:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 08:39:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 08:39:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:39:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:39:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 08:39:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 08:39:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 08:39:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 08:39:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 08:39:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 08:39:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 08:39:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 08:39:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 08:39:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 08:39:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 08:39:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 08:39:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 08:39:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 08:39:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 08:39:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:39:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 08:39:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 08:39:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 08:39:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 08:39:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 08:39:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 08:39:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:39:02,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:39:02,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557709505] [2024-10-14 08:39:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557709505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:39:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:39:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:39:02,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737836277] [2024-10-14 08:39:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:39:02,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:39:02,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:39:02,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:39:02,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:39:02,218 INFO L87 Difference]: Start difference. First operand has 88 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 53 states have internal predecessors, (73), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 08:39:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:39:02,273 INFO L93 Difference]: Finished difference Result 173 states and 309 transitions. [2024-10-14 08:39:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:39:02,278 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 205 [2024-10-14 08:39:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:39:02,287 INFO L225 Difference]: With dead ends: 173 [2024-10-14 08:39:02,288 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 08:39:02,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:39:02,298 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:39:02,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:39:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 08:39:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 08:39:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:39:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2024-10-14 08:39:02,367 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 205 [2024-10-14 08:39:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:39:02,369 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2024-10-14 08:39:02,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 08:39:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2024-10-14 08:39:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 08:39:02,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:39:02,376 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:39:02,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 08:39:02,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:39:02,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:39:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash -512243447, now seen corresponding path program 1 times [2024-10-14 08:39:02,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:39:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855266628] [2024-10-14 08:39:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:39:02,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:39:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:39:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 08:39:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 08:39:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 08:39:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 08:39:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:39:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 08:39:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 08:39:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 08:39:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:39:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:39:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 08:39:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 08:39:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 08:39:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 08:39:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 08:39:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 08:39:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 08:39:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 08:39:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 08:39:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 08:39:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 08:39:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 08:39:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 08:39:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 08:39:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 08:39:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:39:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 08:39:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 08:39:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 08:39:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 08:39:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 08:39:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 08:39:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:39:02,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:39:02,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855266628] [2024-10-14 08:39:02,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855266628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:39:02,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:39:02,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:39:02,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615309600] [2024-10-14 08:39:02,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:39:02,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:39:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:39:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:39:02,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:39:02,957 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:39:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:39:03,060 INFO L93 Difference]: Finished difference Result 256 states and 400 transitions. [2024-10-14 08:39:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:39:03,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-14 08:39:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:39:03,068 INFO L225 Difference]: With dead ends: 256 [2024-10-14 08:39:03,068 INFO L226 Difference]: Without dead ends: 171 [2024-10-14 08:39:03,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:39:03,070 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 130 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:39:03,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 378 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:39:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-14 08:39:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 88. [2024-10-14 08:39:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:39:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2024-10-14 08:39:03,094 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 205 [2024-10-14 08:39:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:39:03,098 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2024-10-14 08:39:03,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:39:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2024-10-14 08:39:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 08:39:03,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:39:03,104 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:39:03,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 08:39:03,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:39:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:39:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 167814923, now seen corresponding path program 1 times [2024-10-14 08:39:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:39:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667615293] [2024-10-14 08:39:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:39:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:39:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:39:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 08:39:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 08:39:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 08:39:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 08:39:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:39:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 08:39:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 08:39:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 08:39:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:39:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:39:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 08:39:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 08:39:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 08:39:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 08:39:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 08:39:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 08:39:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 08:39:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 08:39:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 08:39:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 08:39:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 08:39:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 08:39:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 08:39:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 08:39:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 08:39:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:39:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 08:39:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 08:39:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 08:39:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 08:39:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 08:39:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 08:39:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:39:03,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:39:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667615293] [2024-10-14 08:39:03,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667615293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:39:03,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:39:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:39:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363334459] [2024-10-14 08:39:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:39:03,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:39:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:39:03,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:39:03,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:39:03,559 INFO L87 Difference]: Start difference. First operand 88 states and 136 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:39:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:39:03,623 INFO L93 Difference]: Finished difference Result 262 states and 406 transitions. [2024-10-14 08:39:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:39:03,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-14 08:39:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:39:03,630 INFO L225 Difference]: With dead ends: 262 [2024-10-14 08:39:03,632 INFO L226 Difference]: Without dead ends: 175 [2024-10-14 08:39:03,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:39:03,637 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 64 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:39:03,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 260 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:39:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-14 08:39:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2024-10-14 08:39:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 104 states have internal predecessors, (134), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 08:39:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 266 transitions. [2024-10-14 08:39:03,680 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 266 transitions. Word has length 205 [2024-10-14 08:39:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:39:03,681 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 266 transitions. [2024-10-14 08:39:03,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:39:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 266 transitions. [2024-10-14 08:39:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 08:39:03,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:39:03,684 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:39:03,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 08:39:03,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:39:03,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:39:03,686 INFO L85 PathProgramCache]: Analyzing trace with hash 188821131, now seen corresponding path program 1 times [2024-10-14 08:39:03,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:39:03,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769304185] [2024-10-14 08:39:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:39:03,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:39:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:39:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 08:39:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 08:39:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 08:39:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 08:39:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 08:39:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 08:39:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 08:39:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 08:39:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:39:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:39:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 08:39:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 08:39:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 08:39:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 08:39:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 08:39:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 08:39:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 08:39:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 08:39:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 08:39:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 08:39:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 08:39:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 08:39:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 08:39:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 08:39:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 08:39:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:39:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 08:39:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 08:39:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 08:39:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 08:39:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 08:39:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 08:39:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:39:03,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:39:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769304185] [2024-10-14 08:39:03,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769304185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:39:03,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:39:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:39:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827651510] [2024-10-14 08:39:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:39:03,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:39:03,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:39:03,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:39:03,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:39:03,910 INFO L87 Difference]: Start difference. First operand 173 states and 266 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:39:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:39:03,940 INFO L93 Difference]: Finished difference Result 258 states and 394 transitions. [2024-10-14 08:39:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:39:03,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-14 08:39:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:39:03,943 INFO L225 Difference]: With dead ends: 258 [2024-10-14 08:39:03,943 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 08:39:03,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:39:03,945 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:39:03,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:39:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 08:39:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 08:39:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:39:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2024-10-14 08:39:03,961 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 128 transitions. Word has length 205 [2024-10-14 08:39:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:39:03,963 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 128 transitions. [2024-10-14 08:39:03,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:39:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 128 transitions. [2024-10-14 08:39:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-14 08:39:03,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:39:03,967 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:39:03,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 08:39:03,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:39:03,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:39:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1162259306, now seen corresponding path program 1 times [2024-10-14 08:39:03,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:39:03,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591167543] [2024-10-14 08:39:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:39:03,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:39:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:39:04,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 08:39:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:39:04,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 08:39:04,313 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 08:39:04,314 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 08:39:04,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 08:39:04,318 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 08:39:04,459 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 08:39:04,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:39:04 BoogieIcfgContainer [2024-10-14 08:39:04,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 08:39:04,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 08:39:04,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 08:39:04,465 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 08:39:04,465 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:39:01" (3/4) ... [2024-10-14 08:39:04,467 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 08:39:04,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 08:39:04,469 INFO L158 Benchmark]: Toolchain (without parser) took 4114.08ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 99.0MB in the beginning and 197.9MB in the end (delta: -98.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:39:04,469 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 121.6MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:39:04,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.67ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 82.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 08:39:04,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.66ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 77.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 08:39:04,470 INFO L158 Benchmark]: Boogie Preprocessor took 119.54ms. Allocated memory is still 167.8MB. Free memory was 77.7MB in the beginning and 137.9MB in the end (delta: -60.2MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-14 08:39:04,470 INFO L158 Benchmark]: RCFGBuilder took 605.80ms. Allocated memory is still 167.8MB. Free memory was 137.9MB in the beginning and 106.9MB in the end (delta: 31.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 08:39:04,474 INFO L158 Benchmark]: TraceAbstraction took 2987.30ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 106.9MB in the beginning and 197.9MB in the end (delta: -91.0MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. [2024-10-14 08:39:04,474 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 241.2MB. Free memory is still 197.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:39:04,475 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.09ms. Allocated memory is still 121.6MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.67ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 82.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.66ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 77.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.54ms. Allocated memory is still 167.8MB. Free memory was 77.7MB in the beginning and 137.9MB in the end (delta: -60.2MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * RCFGBuilder took 605.80ms. Allocated memory is still 167.8MB. Free memory was 137.9MB in the beginning and 106.9MB in the end (delta: 31.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2987.30ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 106.9MB in the beginning and 197.9MB in the end (delta: -91.0MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 241.2MB. Free memory is still 197.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 someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] float var_1_24 = 9999999999.375; [L43] unsigned short int var_1_25 = 0; [L44] unsigned short int var_1_26 = 10; [L45] float var_1_27 = 128.75; [L46] double var_1_28 = 9.25; [L47] double var_1_29 = 0.0; [L48] double var_1_30 = 127.6; [L49] double var_1_31 = 64.75; [L50] unsigned long int var_1_32 = 128; [L51] double var_1_33 = 1000000.2; [L52] signed char var_1_34 = -8; [L53] unsigned char var_1_35 = 1; [L54] unsigned char var_1_36 = 1; [L55] signed char var_1_37 = -100; [L56] unsigned long int var_1_38 = 1000; [L57] unsigned long int var_1_39 = 32; [L58] unsigned char last_1_var_1_10 = 200; [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L179] last_1_var_1_10 = var_1_10 [L189] RET updateLastVariables() [L190] CALL updateVariables() [L122] var_1_2 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L123] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L124] var_1_3 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L125] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L126] var_1_4 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_5=99/2, var_1_9=-25] [L127] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_5=99/2, var_1_9=-25] [L128] var_1_5 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L129] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L130] var_1_11 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L131] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L132] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L132] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L133] var_1_12 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L134] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L135] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L135] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L136] var_1_13 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L137] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L138] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L138] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L139] var_1_15 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L140] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L141] var_1_16 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L142] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L143] var_1_17 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L144] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L146] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L147] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L147] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L148] var_1_21 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L149] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L150] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L150] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L151] var_1_23 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L152] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L153] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L153] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L154] var_1_25 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L155] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L156] CALL assume_abort_if_not(var_1_25 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L156] RET assume_abort_if_not(var_1_25 <= 65535) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L157] var_1_26 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L158] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L159] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L159] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L160] var_1_27 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L161] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L162] var_1_29 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L163] RET assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L164] var_1_30 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L165] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_31=259/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L166] var_1_31 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L167] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L168] var_1_35 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L169] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L170] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L170] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L171] var_1_36 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L172] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L173] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L173] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=-100, var_1_38=1000, var_1_39=32, var_1_9=-25] [L174] var_1_37 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_37 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=1000, var_1_39=32, var_1_9=-25] [L175] RET assume_abort_if_not(var_1_37 >= -127) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=1000, var_1_39=32, var_1_9=-25] [L176] CALL assume_abort_if_not(var_1_37 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=1000, var_1_39=32, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=1000, var_1_39=32, var_1_9=-25] [L176] RET assume_abort_if_not(var_1_37 <= 126) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=1000, var_1_39=32, var_1_9=-25] [L190] RET updateVariables() [L191] CALL step() [L62] EXPR var_1_25 & var_1_26 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_25=0, var_1_26=0, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=1000, var_1_39=32, var_1_9=-25] [L62] COND TRUE (var_1_25 & var_1_26) >= -2 [L63] var_1_24 = var_1_27 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=37/4, var_1_32=128, var_1_33=5000001/5, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=1000, var_1_39=32, var_1_9=-25] [L65] var_1_28 = ((8.18603254193775E18 - (var_1_29 - var_1_30)) - var_1_31) [L66] var_1_32 = var_1_25 [L67] var_1_33 = var_1_27 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=1000, var_1_39=32, var_1_9=-25] [L68] COND FALSE !(! (var_1_35 || var_1_36)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=1000, var_1_39=32, var_1_9=-25] [L81] var_1_38 = var_1_25 [L82] var_1_39 = var_1_26 [L83] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-25] [L84] COND TRUE stepLocal_0 >= last_1_var_1_10 [L85] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L89] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L90] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L93] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L96] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L97] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=54, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L100] COND FALSE !(((var_1_2 - var_1_3) * var_1_4) < var_1_5) [L103] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=54, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=54, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L105] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=54, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=54, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L108] COND FALSE !(\read(var_1_19)) [L111] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=54, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=54, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L113] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=54, var_1_11=1, var_1_12=54, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=54, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L114] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L115] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=54, var_1_11=1, var_1_12=54, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=54, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=54, var_1_11=1, var_1_12=54, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=54, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=54, var_1_11=1, var_1_12=54, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=54, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_32=0, var_1_33=10000000004, var_1_34=-8, var_1_35=1, var_1_36=1, var_1_37=126, var_1_38=0, var_1_39=0, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 1015 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 520 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 85 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1027 NumberOfCodeBlocks, 1027 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 816 ConstructedInterpolants, 0 QuantifiedInterpolants, 962 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 8448/8448 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-10-14 08:39:04,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_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 c5bae18a6d5148994ec4a69a5c5f232077dd8ec272c0cbf3326dd03a9563bb98 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:39:06,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:39:06,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 08:39:06,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:39:06,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:39:06,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:39:06,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:39:06,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:39:06,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:39:06,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:39:06,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:39:06,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:39:06,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:39:06,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:39:06,878 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:39:06,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:39:06,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:39:06,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:39:06,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:39:06,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:39:06,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:39:06,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:39:06,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:39:06,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 08:39:06,882 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 08:39:06,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:39:06,882 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 08:39:06,882 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:39:06,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:39:06,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:39:06,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:39:06,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:39:06,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:39:06,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:39:06,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:39:06,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:39:06,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:39:06,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:39:06,892 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 08:39:06,892 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 08:39:06,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:39:06,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:39:06,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:39:06,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:39:06,893 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 08:39:06,894 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 -> c5bae18a6d5148994ec4a69a5c5f232077dd8ec272c0cbf3326dd03a9563bb98 [2024-10-14 08:39:07,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:39:07,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:39:07,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:39:07,221 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:39:07,221 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:39:07,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-80.i [2024-10-14 08:39:08,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:39:09,029 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:39:09,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-80.i [2024-10-14 08:39:09,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f097216/c71d0a3127bc4c739eb7ef182d27aead/FLAG71a26ba27 [2024-10-14 08:39:09,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f097216/c71d0a3127bc4c739eb7ef182d27aead [2024-10-14 08:39:09,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:39:09,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:39:09,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:39:09,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:39:09,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:39:09,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f00ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09, skipping insertion in model container [2024-10-14 08:39:09,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:39:09,574 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-80.i[915,928] [2024-10-14 08:39:09,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:39:09,661 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:39:09,675 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-80.i[915,928] [2024-10-14 08:39:09,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:39:09,756 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:39:09,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09 WrapperNode [2024-10-14 08:39:09,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:39:09,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:39:09,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:39:09,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:39:09,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,821 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-10-14 08:39:09,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:39:09,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:39:09,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:39:09,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:39:09,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,866 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-10-14 08:39:09,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:39:09,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:39:09,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:39:09,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:39:09,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (1/1) ... [2024-10-14 08:39:09,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:39:09,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:39:09,944 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-10-14 08:39:09,946 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-10-14 08:39:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:39:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 08:39:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:39:09,982 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:39:09,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:39:09,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:39:10,077 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:39:10,079 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:39:31,583 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 08:39:31,583 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:39:31,662 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:39:31,662 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:39:31,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:39:31 BoogieIcfgContainer [2024-10-14 08:39:31,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:39:31,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:39:31,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:39:31,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:39:31,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:39:09" (1/3) ... [2024-10-14 08:39:31,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d11886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:39:31, skipping insertion in model container [2024-10-14 08:39:31,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:39:09" (2/3) ... [2024-10-14 08:39:31,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d11886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:39:31, skipping insertion in model container [2024-10-14 08:39:31,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:39:31" (3/3) ... [2024-10-14 08:39:31,675 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-80.i [2024-10-14 08:39:31,700 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:39:31,700 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:39:31,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:39:31,772 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;@516778f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:39:31,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:39:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:39:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 08:39:31,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:39:31,793 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:39:31,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:39:31,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:39:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash 941959489, now seen corresponding path program 1 times [2024-10-14 08:39:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:39:31,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100435883] [2024-10-14 08:39:31,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:39:31,815 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-10-14 08:39:31,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:39:31,817 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-10-14 08:39:31,818 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-10-14 08:39:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:33,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 08:39:33,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:39:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2024-10-14 08:39:33,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:39:33,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:39:33,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100435883] [2024-10-14 08:39:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100435883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:39:33,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:39:33,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:39:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714918605] [2024-10-14 08:39:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:39:33,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:39:33,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:39:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:39:33,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:39:33,169 INFO L87 Difference]: Start difference. First operand has 85 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 08:39:37,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:39:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:39:37,538 INFO L93 Difference]: Finished difference Result 167 states and 299 transitions. [2024-10-14 08:39:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:39:37,653 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2024-10-14 08:39:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:39:37,660 INFO L225 Difference]: With dead ends: 167 [2024-10-14 08:39:37,661 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 08:39:37,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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-10-14 08:39:37,668 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 08:39:37,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 08:39:37,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 08:39:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-14 08:39:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:39:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2024-10-14 08:39:37,738 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 204 [2024-10-14 08:39:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:39:37,739 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2024-10-14 08:39:37,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 08:39:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2024-10-14 08:39:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 08:39:37,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:39:37,748 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:39:37,795 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-10-14 08:39:37,949 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-10-14 08:39:37,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:39:37,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:39:37,950 INFO L85 PathProgramCache]: Analyzing trace with hash -471353737, now seen corresponding path program 1 times [2024-10-14 08:39:37,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:39:37,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667486386] [2024-10-14 08:39:37,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:39:37,951 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-10-14 08:39:37,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:39:37,953 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-10-14 08:39:37,954 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-10-14 08:39:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:39:39,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 08:39:39,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:39:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:39:39,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:39:39,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:39:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667486386] [2024-10-14 08:39:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667486386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:39:39,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:39:39,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:39:39,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391976506] [2024-10-14 08:39:39,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:39:39,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:39:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:39:39,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:39:39,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:39:39,578 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:39:44,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 08:39:48,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 08:39:52,540 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-10-14 08:39:56,558 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 [0] [2024-10-14 08:40:00,564 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 [0] [2024-10-14 08:40:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:40:00,713 INFO L93 Difference]: Finished difference Result 247 states and 382 transitions. [2024-10-14 08:40:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:40:00,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-10-14 08:40:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:40:00,722 INFO L225 Difference]: With dead ends: 247 [2024-10-14 08:40:00,722 INFO L226 Difference]: Without dead ends: 165 [2024-10-14 08:40:00,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:40:00,728 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 124 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:40:00,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 360 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 21.0s Time] [2024-10-14 08:40:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-14 08:40:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 85. [2024-10-14 08:40:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 08:40:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 130 transitions. [2024-10-14 08:40:00,758 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 130 transitions. Word has length 204 [2024-10-14 08:40:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:40:00,764 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 130 transitions. [2024-10-14 08:40:00,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:40:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 130 transitions. [2024-10-14 08:40:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 08:40:00,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:40:00,770 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:40:00,806 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-10-14 08:40:00,971 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-10-14 08:40:00,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:40:00,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:40:00,972 INFO L85 PathProgramCache]: Analyzing trace with hash 208704633, now seen corresponding path program 1 times [2024-10-14 08:40:00,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:40:00,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462415725] [2024-10-14 08:40:00,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:40:00,974 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-10-14 08:40:00,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:40:00,977 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-10-14 08:40:00,978 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-10-14 08:40:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:40:02,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 08:40:02,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:40:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:40:08,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:40:08,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:40:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462415725] [2024-10-14 08:40:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462415725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:40:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:40:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:40:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119222879] [2024-10-14 08:40:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:40:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:40:08,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:40:08,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:40:08,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:40:08,190 INFO L87 Difference]: Start difference. First operand 85 states and 130 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:40:12,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:40:16,872 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-10-14 08:40:20,877 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-10-14 08:40:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:40:21,022 INFO L93 Difference]: Finished difference Result 251 states and 384 transitions. [2024-10-14 08:40:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:40:21,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-10-14 08:40:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:40:21,029 INFO L225 Difference]: With dead ends: 251 [2024-10-14 08:40:21,029 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 08:40:21,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:40:21,031 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 21 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-10-14 08:40:21,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 241 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2024-10-14 08:40:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 08:40:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2024-10-14 08:40:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 96 states have internal predecessors, (118), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 08:40:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2024-10-14 08:40:21,057 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 204 [2024-10-14 08:40:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:40:21,058 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2024-10-14 08:40:21,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 08:40:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2024-10-14 08:40:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 08:40:21,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:40:21,062 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:40:21,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 08:40:21,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:40:21,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:40:21,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:40:21,264 INFO L85 PathProgramCache]: Analyzing trace with hash 227863799, now seen corresponding path program 1 times [2024-10-14 08:40:21,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:40:21,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004308386] [2024-10-14 08:40:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:40:21,265 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-10-14 08:40:21,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:40:21,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 08:40:21,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 08:40:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:40:22,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 08:40:22,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:40:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 08:40:28,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:40:28,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:40:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004308386] [2024-10-14 08:40:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004308386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:40:28,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:40:28,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:40:28,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542426990] [2024-10-14 08:40:28,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:40:28,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 08:40:28,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:40:28,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 08:40:28,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:40:28,411 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)