/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:19:53,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:19:54,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:19:54,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:19:54,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:19:54,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:19:54,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:19:54,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:19:54,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:19:54,045 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:19:54,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:19:54,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:19:54,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:19:54,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:19:54,047 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:19:54,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:19:54,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:19:54,047 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:19:54,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:19:54,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:19:54,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:19:54,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:19:54,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:19:54,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:19:54,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:19:54,049 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:19:54,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:19:54,049 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:19:54,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:19:54,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:19:54,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:19:54,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:19:54,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:19:54,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:19:54,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:19:54,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:19:54,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:19:54,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:19:54,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:19:54,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:19:54,051 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:19:54,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:19:54,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:19:54,052 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: Use bitabs translation -> false [2023-12-16 04:19:54,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:19:54,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:19:54,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:19:54,264 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:19:54,265 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:19:54,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i [2023-12-16 04:19:55,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:19:55,752 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:19:55,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i [2023-12-16 04:19:55,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da830aa8a/4a3185e3db0643b3be61a40d87b51409/FLAG96817a57c [2023-12-16 04:19:55,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da830aa8a/4a3185e3db0643b3be61a40d87b51409 [2023-12-16 04:19:55,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:19:55,785 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:19:55,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:19:55,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:19:55,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:19:55,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:19:55" (1/1) ... [2023-12-16 04:19:55,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484933da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:55, skipping insertion in model container [2023-12-16 04:19:55,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:19:55" (1/1) ... [2023-12-16 04:19:55,817 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:19:55,927 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i[916,929] [2023-12-16 04:19:55,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:19:55,983 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:19:55,990 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i[916,929] [2023-12-16 04:19:56,028 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:19:56,040 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:19:56,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56 WrapperNode [2023-12-16 04:19:56,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:19:56,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:19:56,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:19:56,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:19:56,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,087 INFO L138 Inliner]: procedures = 29, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 580 [2023-12-16 04:19:56,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:19:56,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:19:56,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:19:56,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:19:56,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,116 INFO L175 MemorySlicer]: Split 152 memory accesses to 4 slices as follows [2, 37, 70, 43]. 46 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 20 writes are split as follows [0, 7, 5, 8]. [2023-12-16 04:19:56,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:19:56,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:19:56,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:19:56,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:19:56,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (1/1) ... [2023-12-16 04:19:56,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:19:56,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:19:56,276 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) [2023-12-16 04:19:56,293 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 [2023-12-16 04:19:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:19:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:19:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:19:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:19:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:19:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:19:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:19:56,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:19:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:19:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:19:56,300 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:19:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:19:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:19:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:19:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:19:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:19:56,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:19:56,449 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:19:56,450 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:19:57,003 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:19:57,041 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:19:57,041 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:19:57,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:19:57 BoogieIcfgContainer [2023-12-16 04:19:57,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:19:57,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:19:57,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:19:57,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:19:57,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:19:55" (1/3) ... [2023-12-16 04:19:57,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b079238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:19:57, skipping insertion in model container [2023-12-16 04:19:57,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:19:56" (2/3) ... [2023-12-16 04:19:57,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b079238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:19:57, skipping insertion in model container [2023-12-16 04:19:57,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:19:57" (3/3) ... [2023-12-16 04:19:57,050 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-74.i [2023-12-16 04:19:57,064 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:19:57,064 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:19:57,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:19:57,111 INFO L357 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, mHoare=true, 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;@4d504d50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:19:57,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:19:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 98 states have (on average 1.469387755102041) internal successors, (144), 99 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:19:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 04:19:57,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:57,133 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:57,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:57,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1424913464, now seen corresponding path program 1 times [2023-12-16 04:19:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:57,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139965838] [2023-12-16 04:19:57,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:57,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:19:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:19:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:19:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:19:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:19:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:19:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:19:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:19:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:19:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:19:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:19:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:19:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:19:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 04:19:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 04:19:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:19:57,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:57,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139965838] [2023-12-16 04:19:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139965838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:57,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:19:57,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:19:57,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691895968] [2023-12-16 04:19:57,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:57,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:19:57,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:57,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:19:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:19:57,623 INFO L87 Difference]: Start difference. First operand has 118 states, 98 states have (on average 1.469387755102041) internal successors, (144), 99 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:19:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:57,672 INFO L93 Difference]: Finished difference Result 233 states and 371 transitions. [2023-12-16 04:19:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:19:57,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2023-12-16 04:19:57,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:57,682 INFO L225 Difference]: With dead ends: 233 [2023-12-16 04:19:57,682 INFO L226 Difference]: Without dead ends: 116 [2023-12-16 04:19:57,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:19:57,689 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:57,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:19:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-16 04:19:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-12-16 04:19:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 97 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:19:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 173 transitions. [2023-12-16 04:19:57,735 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 173 transitions. Word has length 145 [2023-12-16 04:19:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:57,735 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 173 transitions. [2023-12-16 04:19:57,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:19:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 173 transitions. [2023-12-16 04:19:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 04:19:57,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:57,738 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:57,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:19:57,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:57,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1008421762, now seen corresponding path program 1 times [2023-12-16 04:19:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:57,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27221181] [2023-12-16 04:19:57,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:57,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:19:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:19:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:19:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:19:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:19:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:19:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:19:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:19:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:19:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:19:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:19:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:19:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:19:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 04:19:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 04:19:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:19:58,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27221181] [2023-12-16 04:19:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27221181] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:58,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:19:58,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:19:58,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705140411] [2023-12-16 04:19:58,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:58,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:19:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:58,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:19:58,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:19:58,098 INFO L87 Difference]: Start difference. First operand 116 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:19:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:58,169 INFO L93 Difference]: Finished difference Result 237 states and 354 transitions. [2023-12-16 04:19:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:19:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2023-12-16 04:19:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:58,175 INFO L225 Difference]: With dead ends: 237 [2023-12-16 04:19:58,176 INFO L226 Difference]: Without dead ends: 122 [2023-12-16 04:19:58,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:19:58,177 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 10 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:58,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 499 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:19:58,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-16 04:19:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2023-12-16 04:19:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 99 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:19:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 175 transitions. [2023-12-16 04:19:58,186 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 175 transitions. Word has length 145 [2023-12-16 04:19:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:58,186 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 175 transitions. [2023-12-16 04:19:58,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:19:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 175 transitions. [2023-12-16 04:19:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 04:19:58,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:58,190 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:58,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:19:58,190 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:58,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 298720636, now seen corresponding path program 1 times [2023-12-16 04:19:58,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:58,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390129163] [2023-12-16 04:19:58,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:58,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:19:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:19:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:19:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:19:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:19:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:19:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:19:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:19:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:19:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:19:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:19:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:19:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:19:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 04:19:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 04:19:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:19:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:58,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390129163] [2023-12-16 04:19:58,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390129163] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:58,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:19:58,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:19:58,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61771431] [2023-12-16 04:19:58,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:58,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:19:58,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:58,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:19:58,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:19:58,506 INFO L87 Difference]: Start difference. First operand 118 states and 175 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:19:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:58,663 INFO L93 Difference]: Finished difference Result 311 states and 465 transitions. [2023-12-16 04:19:58,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:19:58,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2023-12-16 04:19:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:58,668 INFO L225 Difference]: With dead ends: 311 [2023-12-16 04:19:58,669 INFO L226 Difference]: Without dead ends: 194 [2023-12-16 04:19:58,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:19:58,674 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 75 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:58,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 469 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:19:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-16 04:19:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 119. [2023-12-16 04:19:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:19:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2023-12-16 04:19:58,691 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 145 [2023-12-16 04:19:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:58,692 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2023-12-16 04:19:58,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-16 04:19:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2023-12-16 04:19:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 04:19:58,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:58,693 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:58,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:19:58,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:58,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash 164707130, now seen corresponding path program 1 times [2023-12-16 04:19:58,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:58,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071858049] [2023-12-16 04:19:58,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:58,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:19:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:19:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:19:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:19:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:19:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:19:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:19:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:19:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:19:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:19:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:19:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:19:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:19:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:19:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:19:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 04:19:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 04:19:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 04:19:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:19:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-16 04:19:59,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:19:59,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071858049] [2023-12-16 04:19:59,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071858049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:19:59,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:19:59,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:19:59,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022403342] [2023-12-16 04:19:59,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:19:59,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:19:59,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:19:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:19:59,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:19:59,691 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:19:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:19:59,967 INFO L93 Difference]: Finished difference Result 360 states and 531 transitions. [2023-12-16 04:19:59,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:19:59,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2023-12-16 04:19:59,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:19:59,969 INFO L225 Difference]: With dead ends: 360 [2023-12-16 04:19:59,969 INFO L226 Difference]: Without dead ends: 242 [2023-12-16 04:19:59,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:19:59,971 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 248 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:19:59,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1522 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:19:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-12-16 04:19:59,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 213. [2023-12-16 04:19:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 178 states have (on average 1.404494382022472) internal successors, (250), 179 states have internal predecessors, (250), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:19:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 314 transitions. [2023-12-16 04:19:59,981 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 314 transitions. Word has length 145 [2023-12-16 04:19:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:19:59,981 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 314 transitions. [2023-12-16 04:19:59,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-16 04:19:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 314 transitions. [2023-12-16 04:19:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 04:19:59,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:19:59,983 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:19:59,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:19:59,983 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:19:59,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:19:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash 844765500, now seen corresponding path program 1 times [2023-12-16 04:19:59,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:19:59,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965225375] [2023-12-16 04:19:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:19:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:20:00,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:20:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:20:00,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:20:00,194 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:20:00,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:20:00,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:20:00,199 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 04:20:00,202 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:20:00,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:20:00 BoogieIcfgContainer [2023-12-16 04:20:00,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:20:00,288 INFO L158 Benchmark]: Toolchain (without parser) took 4503.63ms. Allocated memory was 187.7MB in the beginning and 351.3MB in the end (delta: 163.6MB). Free memory was 136.8MB in the beginning and 287.1MB in the end (delta: -150.3MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2023-12-16 04:20:00,288 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:20:00,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.08ms. Allocated memory is still 187.7MB. Free memory was 136.8MB in the beginning and 121.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 04:20:00,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.25ms. Allocated memory is still 187.7MB. Free memory was 121.1MB in the beginning and 116.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:20:00,289 INFO L158 Benchmark]: Boogie Preprocessor took 105.02ms. Allocated memory is still 187.7MB. Free memory was 116.9MB in the beginning and 111.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:20:00,289 INFO L158 Benchmark]: RCFGBuilder took 848.28ms. Allocated memory was 187.7MB in the beginning and 263.2MB in the end (delta: 75.5MB). Free memory was 111.7MB in the beginning and 212.3MB in the end (delta: -100.6MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB. [2023-12-16 04:20:00,290 INFO L158 Benchmark]: TraceAbstraction took 3244.68ms. Allocated memory was 263.2MB in the beginning and 351.3MB in the end (delta: 88.1MB). Free memory was 211.8MB in the beginning and 287.1MB in the end (delta: -75.3MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2023-12-16 04:20:00,291 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.10ms. Allocated memory is still 187.7MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.08ms. Allocated memory is still 187.7MB. Free memory was 136.8MB in the beginning and 121.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.25ms. Allocated memory is still 187.7MB. Free memory was 121.1MB in the beginning and 116.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 105.02ms. Allocated memory is still 187.7MB. Free memory was 116.9MB in the beginning and 111.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 848.28ms. Allocated memory was 187.7MB in the beginning and 263.2MB in the end (delta: 75.5MB). Free memory was 111.7MB in the beginning and 212.3MB in the end (delta: -100.6MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3244.68ms. Allocated memory was 263.2MB in the beginning and 351.3MB in the end (delta: 88.1MB). Free memory was 211.8MB in the beginning and 287.1MB in the end (delta: -75.3MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * 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 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L31] unsigned char last_1_BOOL_unsigned_char_Array_0_1__0_ = 1; [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L96] EXPR BOOL_unsigned_char_Array_0[1][0] [L96] last_1_BOOL_unsigned_char_Array_0_1__0_ = BOOL_unsigned_char_Array_0[1][0] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L66] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L69] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L72] double_Array_0[0] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[0] [L73] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L73] EXPR double_Array_0[0] [L73] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L74] double_Array_0[1] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L76] double_Array_0[2] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[2] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F [L77] EXPR double_Array_0[2] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L78] double_Array_0[3] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR (double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR (double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L80] double_Array_0[4] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[4] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F [L81] EXPR double_Array_0[4] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR (double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR (double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not((double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not((double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L82] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L83] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L85] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L86] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L88] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L91] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L92] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L92] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L92] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L107] RET updateVariables() [L108] CALL step() [L35] unsigned char stepLocal_0 = last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_; [L36] EXPR double_Array_0[1] [L36] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L36] COND TRUE (double_Array_0[1] > double_Array_0[0]) || stepLocal_0 [L37] EXPR BOOL_unsigned_char_Array_0[0][1] [L37] BOOL_unsigned_char_Array_0[0][0] = BOOL_unsigned_char_Array_0[0][1] [L41] EXPR BOOL_unsigned_char_Array_0[0][0] [L41] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[0][0]; [L42] stepLocal_1 && BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, stepLocal_0=1, stepLocal_1=0, unsigned_long_int_Array_0={6:0}] [L42] stepLocal_1 && BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L42] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[0][0]) [L49] EXPR BOOL_unsigned_char_Array_0[1][1] [L49] BOOL_unsigned_char_Array_0[1][0] = BOOL_unsigned_char_Array_0[1][1] [L51] EXPR double_Array_0[4] [L51] EXPR double_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) [L51] EXPR double_Array_0[4] [L51] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, stepLocal_0=1, stepLocal_1=0, unsigned_long_int_Array_0={6:0}] [L51] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) [L51] EXPR double_Array_0[2] [L51] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, stepLocal_0=1, stepLocal_1=0, unsigned_long_int_Array_0={6:0}] [L51] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] COND FALSE !(((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) [L54] EXPR double_Array_0[4] [L54] EXPR double_Array_0[3] [L54] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L54] COND FALSE !(double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) [L61] EXPR unsigned_long_int_Array_0[3] [L61] unsigned_long_int_Array_0[4] = unsigned_long_int_Array_0[3] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR double_Array_0[4] [L99] EXPR double_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) [L99] EXPR double_Array_0[4] [L99] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) [L99] EXPR double_Array_0[2] [L99] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) [L99] EXPR unsigned_long_int_Array_0[4] [L99] EXPR unsigned_long_int_Array_0[3] [L99] EXPR unsigned_long_int_Array_0[2] [L99] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])) [L99] EXPR unsigned_long_int_Array_0[2] [L99] EXPR unsigned_long_int_Array_0[1] [L99] EXPR ((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99-L100] return (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 2659 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1888 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 771 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=4, InterpolantAutomatonStates: 22, 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, 108 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2176/2176 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 [2023-12-16 04:20:00,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...