/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 14:59:22,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 14:59:23,042 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-19 14:59:23,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 14:59:23,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 14:59:23,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 14:59:23,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 14:59:23,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 14:59:23,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 14:59:23,061 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 14:59:23,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 14:59:23,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 14:59:23,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 14:59:23,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 14:59:23,062 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 14:59:23,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 14:59:23,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 14:59:23,063 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 14:59:23,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 14:59:23,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 14:59:23,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 14:59:23,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 14:59:23,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 14:59:23,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 14:59:23,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 14:59:23,065 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 14:59:23,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 14:59:23,065 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 14:59:23,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 14:59:23,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 14:59:23,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 14:59:23,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 14:59:23,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:59:23,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 14:59:23,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 14:59:23,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 14:59:23,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 14:59:23,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 14:59:23,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 14:59:23,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 14:59:23,068 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 14:59:23,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 14:59:23,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 14:59:23,068 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 -> true [2023-12-19 14:59:23,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 14:59:23,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 14:59:23,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 14:59:23,248 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 14:59:23,248 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 14:59:23,249 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-23.i [2023-12-19 14:59:24,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 14:59:24,549 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 14:59:24,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i [2023-12-19 14:59:24,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c671d2251/bc56458c225340589792c9152b7cde27/FLAG201f83d0b [2023-12-19 14:59:24,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c671d2251/bc56458c225340589792c9152b7cde27 [2023-12-19 14:59:24,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 14:59:24,569 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 14:59:24,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 14:59:24,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 14:59:24,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 14:59:24,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b85521c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24, skipping insertion in model container [2023-12-19 14:59:24,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,599 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 14:59:24,685 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-23.i[916,929] [2023-12-19 14:59:24,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:59:24,748 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 14:59:24,756 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-23.i[916,929] [2023-12-19 14:59:24,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:59:24,816 INFO L206 MainTranslator]: Completed translation [2023-12-19 14:59:24,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24 WrapperNode [2023-12-19 14:59:24,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 14:59:24,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 14:59:24,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 14:59:24,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 14:59:24,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,882 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 539 [2023-12-19 14:59:24,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 14:59:24,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 14:59:24,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 14:59:24,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 14:59:24,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,914 INFO L175 MemorySlicer]: Split 146 memory accesses to 4 slices as follows [2, 26, 51, 67]. 46 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 8]. The 18 writes are split as follows [0, 5, 5, 8]. [2023-12-19 14:59:24,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 14:59:24,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 14:59:24,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 14:59:24,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 14:59:24,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (1/1) ... [2023-12-19 14:59:24,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:59:24,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:59:25,017 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-19 14:59:25,039 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-19 14:59:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 14:59:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 14:59:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 14:59:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 14:59:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 14:59:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 14:59:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 14:59:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 14:59:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 14:59:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 14:59:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 14:59:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 14:59:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 14:59:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 14:59:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 14:59:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 14:59:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 14:59:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 14:59:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 14:59:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 14:59:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 14:59:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 14:59:25,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 14:59:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 14:59:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 14:59:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 14:59:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 14:59:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 14:59:25,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 14:59:25,154 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 14:59:25,155 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 14:59:25,474 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 14:59:25,503 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 14:59:25,503 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 14:59:25,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:59:25 BoogieIcfgContainer [2023-12-19 14:59:25,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 14:59:25,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 14:59:25,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 14:59:25,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 14:59:25,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:59:24" (1/3) ... [2023-12-19 14:59:25,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61879754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:59:25, skipping insertion in model container [2023-12-19 14:59:25,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:24" (2/3) ... [2023-12-19 14:59:25,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61879754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:59:25, skipping insertion in model container [2023-12-19 14:59:25,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:59:25" (3/3) ... [2023-12-19 14:59:25,518 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-23.i [2023-12-19 14:59:25,530 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 14:59:25,530 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 14:59:25,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 14:59:25,577 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;@4ab58a46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 14:59:25,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 14:59:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 14:59:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-19 14:59:25,597 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:25,598 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:25,598 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:25,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash -584165321, now seen corresponding path program 1 times [2023-12-19 14:59:25,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:25,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934625163] [2023-12-19 14:59:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:25,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:25,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:25,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:25,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:25,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:25,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:25,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:25,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:25,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:25,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:25,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,034 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:26,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:26,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934625163] [2023-12-19 14:59:26,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934625163] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:26,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:26,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 14:59:26,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291080148] [2023-12-19 14:59:26,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:26,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 14:59:26,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:26,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 14:59:26,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 14:59:26,069 INFO L87 Difference]: Start difference. First operand has 117 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:26,113 INFO L93 Difference]: Finished difference Result 231 states and 370 transitions. [2023-12-19 14:59:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 14:59:26,114 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2023-12-19 14:59:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:26,122 INFO L225 Difference]: With dead ends: 231 [2023-12-19 14:59:26,122 INFO L226 Difference]: Without dead ends: 115 [2023-12-19 14:59:26,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-19 14:59:26,129 INFO L413 NwaCegarLoop]: 167 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, 167 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-19 14:59:26,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:59:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-19 14:59:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-19 14:59:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 14:59:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2023-12-19 14:59:26,162 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 160 [2023-12-19 14:59:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:26,163 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2023-12-19 14:59:26,163 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2023-12-19 14:59:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-19 14:59:26,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:26,165 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:26,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 14:59:26,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:26,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1034269821, now seen corresponding path program 1 times [2023-12-19 14:59:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:26,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55999629] [2023-12-19 14:59:26,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55999629] [2023-12-19 14:59:26,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55999629] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:26,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:26,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 14:59:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126003482] [2023-12-19 14:59:26,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:26,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 14:59:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 14:59:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 14:59:26,480 INFO L87 Difference]: Start difference. First operand 115 states and 171 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:26,545 INFO L93 Difference]: Finished difference Result 235 states and 350 transitions. [2023-12-19 14:59:26,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 14:59:26,545 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2023-12-19 14:59:26,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:26,549 INFO L225 Difference]: With dead ends: 235 [2023-12-19 14:59:26,549 INFO L226 Difference]: Without dead ends: 121 [2023-12-19 14:59:26,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-19 14:59:26,550 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 10 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 493 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-19 14:59:26,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 493 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:59:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-19 14:59:26,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2023-12-19 14:59:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 14:59:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2023-12-19 14:59:26,566 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 160 [2023-12-19 14:59:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:26,567 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2023-12-19 14:59:26,567 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2023-12-19 14:59:26,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-19 14:59:26,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:26,572 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:26,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 14:59:26,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:26,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:26,573 INFO L85 PathProgramCache]: Analyzing trace with hash -701626683, now seen corresponding path program 1 times [2023-12-19 14:59:26,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:26,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971646133] [2023-12-19 14:59:26,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:26,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:27,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:27,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971646133] [2023-12-19 14:59:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971646133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:27,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 14:59:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159924265] [2023-12-19 14:59:27,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:27,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 14:59:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 14:59:27,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-19 14:59:27,811 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:28,552 INFO L93 Difference]: Finished difference Result 473 states and 700 transitions. [2023-12-19 14:59:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 14:59:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2023-12-19 14:59:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:28,558 INFO L225 Difference]: With dead ends: 473 [2023-12-19 14:59:28,558 INFO L226 Difference]: Without dead ends: 357 [2023-12-19 14:59:28,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-12-19 14:59:28,559 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 488 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:28,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1765 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 14:59:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-12-19 14:59:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 236. [2023-12-19 14:59:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 195 states have (on average 1.4153846153846155) internal successors, (276), 196 states have internal predecessors, (276), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 14:59:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 352 transitions. [2023-12-19 14:59:28,633 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 352 transitions. Word has length 160 [2023-12-19 14:59:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:28,635 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 352 transitions. [2023-12-19 14:59:28,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 352 transitions. [2023-12-19 14:59:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-19 14:59:28,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:28,638 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:28,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 14:59:28,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:28,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash -443461245, now seen corresponding path program 1 times [2023-12-19 14:59:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:28,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363065774] [2023-12-19 14:59:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:29,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:29,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363065774] [2023-12-19 14:59:29,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363065774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:29,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:29,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 14:59:29,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158249721] [2023-12-19 14:59:29,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:29,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 14:59:29,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:29,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 14:59:29,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-19 14:59:29,795 INFO L87 Difference]: Start difference. First operand 236 states and 352 transitions. Second operand has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-19 14:59:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:30,738 INFO L93 Difference]: Finished difference Result 631 states and 932 transitions. [2023-12-19 14:59:30,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 14:59:30,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-12-19 14:59:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:30,742 INFO L225 Difference]: With dead ends: 631 [2023-12-19 14:59:30,742 INFO L226 Difference]: Without dead ends: 396 [2023-12-19 14:59:30,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-19 14:59:30,743 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 402 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:30,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 993 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 14:59:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-12-19 14:59:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 303. [2023-12-19 14:59:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 244 states have (on average 1.3852459016393444) internal successors, (338), 246 states have internal predecessors, (338), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-19 14:59:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 446 transitions. [2023-12-19 14:59:30,779 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 446 transitions. Word has length 160 [2023-12-19 14:59:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:30,780 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 446 transitions. [2023-12-19 14:59:30,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-19 14:59:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 446 transitions. [2023-12-19 14:59:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-19 14:59:30,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:30,781 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:30,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 14:59:30,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:30,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:30,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1904396871, now seen corresponding path program 1 times [2023-12-19 14:59:30,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:30,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936993176] [2023-12-19 14:59:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:30,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936993176] [2023-12-19 14:59:31,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936993176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:31,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:31,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 14:59:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530169421] [2023-12-19 14:59:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:31,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 14:59:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:31,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 14:59:31,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-19 14:59:31,533 INFO L87 Difference]: Start difference. First operand 303 states and 446 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:32,085 INFO L93 Difference]: Finished difference Result 550 states and 807 transitions. [2023-12-19 14:59:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 14:59:32,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2023-12-19 14:59:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:32,090 INFO L225 Difference]: With dead ends: 550 [2023-12-19 14:59:32,090 INFO L226 Difference]: Without dead ends: 311 [2023-12-19 14:59:32,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-19 14:59:32,093 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 280 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:32,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1412 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 14:59:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-19 14:59:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 292. [2023-12-19 14:59:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 233 states have (on average 1.3776824034334765) internal successors, (321), 235 states have internal predecessors, (321), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-19 14:59:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 429 transitions. [2023-12-19 14:59:32,142 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 429 transitions. Word has length 160 [2023-12-19 14:59:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:32,142 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 429 transitions. [2023-12-19 14:59:32,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 429 transitions. [2023-12-19 14:59:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-19 14:59:32,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:32,144 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:32,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 14:59:32,144 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:32,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1787902279, now seen corresponding path program 1 times [2023-12-19 14:59:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968140775] [2023-12-19 14:59:32,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:32,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:32,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:32,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968140775] [2023-12-19 14:59:32,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968140775] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:32,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:32,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 14:59:32,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945162276] [2023-12-19 14:59:32,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:32,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 14:59:32,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:32,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 14:59:32,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:59:32,859 INFO L87 Difference]: Start difference. First operand 292 states and 429 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-19 14:59:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:33,234 INFO L93 Difference]: Finished difference Result 527 states and 769 transitions. [2023-12-19 14:59:33,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 14:59:33,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-12-19 14:59:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:33,235 INFO L225 Difference]: With dead ends: 527 [2023-12-19 14:59:33,236 INFO L226 Difference]: Without dead ends: 299 [2023-12-19 14:59:33,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-19 14:59:33,237 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 179 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:33,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1239 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 14:59:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-19 14:59:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 233. [2023-12-19 14:59:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 190 states have (on average 1.3789473684210527) internal successors, (262), 191 states have internal predecessors, (262), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 14:59:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 338 transitions. [2023-12-19 14:59:33,266 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 338 transitions. Word has length 160 [2023-12-19 14:59:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:33,267 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 338 transitions. [2023-12-19 14:59:33,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-19 14:59:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 338 transitions. [2023-12-19 14:59:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-19 14:59:33,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:33,268 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:33,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 14:59:33,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:33,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2046067717, now seen corresponding path program 1 times [2023-12-19 14:59:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:33,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522196055] [2023-12-19 14:59:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:33,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:33,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:33,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522196055] [2023-12-19 14:59:33,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522196055] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:33,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:33,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 14:59:33,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704840009] [2023-12-19 14:59:33,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:33,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 14:59:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:33,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 14:59:33,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-19 14:59:33,932 INFO L87 Difference]: Start difference. First operand 233 states and 338 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:34,250 INFO L93 Difference]: Finished difference Result 531 states and 770 transitions. [2023-12-19 14:59:34,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 14:59:34,251 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2023-12-19 14:59:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:34,252 INFO L225 Difference]: With dead ends: 531 [2023-12-19 14:59:34,252 INFO L226 Difference]: Without dead ends: 299 [2023-12-19 14:59:34,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:59:34,255 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 214 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:34,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1600 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:59:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-19 14:59:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 233. [2023-12-19 14:59:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 190 states have (on average 1.3736842105263158) internal successors, (261), 191 states have internal predecessors, (261), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 14:59:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 337 transitions. [2023-12-19 14:59:34,292 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 337 transitions. Word has length 160 [2023-12-19 14:59:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:34,292 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 337 transitions. [2023-12-19 14:59:34,292 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 337 transitions. [2023-12-19 14:59:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-19 14:59:34,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:34,293 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:34,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 14:59:34,294 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:34,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1568119795, now seen corresponding path program 1 times [2023-12-19 14:59:34,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:34,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972132505] [2023-12-19 14:59:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:34,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:34,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972132505] [2023-12-19 14:59:34,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972132505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:34,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:34,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 14:59:34,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117266439] [2023-12-19 14:59:34,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:34,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 14:59:34,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:34,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 14:59:34,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:59:34,446 INFO L87 Difference]: Start difference. First operand 233 states and 337 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 14:59:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:34,500 INFO L93 Difference]: Finished difference Result 503 states and 729 transitions. [2023-12-19 14:59:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:59:34,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2023-12-19 14:59:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:34,502 INFO L225 Difference]: With dead ends: 503 [2023-12-19 14:59:34,502 INFO L226 Difference]: Without dead ends: 271 [2023-12-19 14:59:34,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:59:34,503 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 61 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:34,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 638 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:59:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-19 14:59:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 239. [2023-12-19 14:59:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 197 states have internal predecessors, (267), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 14:59:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 343 transitions. [2023-12-19 14:59:34,534 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 343 transitions. Word has length 162 [2023-12-19 14:59:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:34,534 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 343 transitions. [2023-12-19 14:59:34,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 14:59:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 343 transitions. [2023-12-19 14:59:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-19 14:59:34,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:34,536 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:34,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 14:59:34,536 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:34,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1996391368, now seen corresponding path program 1 times [2023-12-19 14:59:34,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:34,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572890099] [2023-12-19 14:59:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:34,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:35,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:35,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572890099] [2023-12-19 14:59:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572890099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:35,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:35,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 14:59:35,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103253162] [2023-12-19 14:59:35,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:35,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 14:59:35,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:35,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 14:59:35,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:59:35,119 INFO L87 Difference]: Start difference. First operand 239 states and 343 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:35,569 INFO L93 Difference]: Finished difference Result 756 states and 1087 transitions. [2023-12-19 14:59:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 14:59:35,571 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2023-12-19 14:59:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:35,575 INFO L225 Difference]: With dead ends: 756 [2023-12-19 14:59:35,575 INFO L226 Difference]: Without dead ends: 518 [2023-12-19 14:59:35,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-12-19 14:59:35,577 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 287 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:35,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1186 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 14:59:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-12-19 14:59:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 272. [2023-12-19 14:59:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 229 states have (on average 1.3711790393013101) internal successors, (314), 230 states have internal predecessors, (314), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 14:59:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 390 transitions. [2023-12-19 14:59:35,616 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 390 transitions. Word has length 164 [2023-12-19 14:59:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:35,617 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 390 transitions. [2023-12-19 14:59:35,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 14:59:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 390 transitions. [2023-12-19 14:59:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-19 14:59:35,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:35,618 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:35,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 14:59:35,619 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:35,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1316332998, now seen corresponding path program 1 times [2023-12-19 14:59:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592730722] [2023-12-19 14:59:35,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:37,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592730722] [2023-12-19 14:59:37,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592730722] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:37,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:37,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 14:59:37,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270631171] [2023-12-19 14:59:37,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:37,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 14:59:37,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:37,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 14:59:37,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-12-19 14:59:37,026 INFO L87 Difference]: Start difference. First operand 272 states and 390 transitions. Second operand has 13 states, 8 states have (on average 8.375) internal successors, (67), 13 states have internal predecessors, (67), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-19 14:59:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:37,930 INFO L93 Difference]: Finished difference Result 773 states and 1108 transitions. [2023-12-19 14:59:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-19 14:59:37,931 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 8 states have (on average 8.375) internal successors, (67), 13 states have internal predecessors, (67), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 6 states have call successors, (20) Word has length 164 [2023-12-19 14:59:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:37,932 INFO L225 Difference]: With dead ends: 773 [2023-12-19 14:59:37,933 INFO L226 Difference]: Without dead ends: 502 [2023-12-19 14:59:37,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2023-12-19 14:59:37,934 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 395 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:37,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1940 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 14:59:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-12-19 14:59:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 354. [2023-12-19 14:59:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 300 states have (on average 1.37) internal successors, (411), 302 states have internal predecessors, (411), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 14:59:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 507 transitions. [2023-12-19 14:59:37,983 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 507 transitions. Word has length 164 [2023-12-19 14:59:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:37,984 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 507 transitions. [2023-12-19 14:59:37,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 8 states have (on average 8.375) internal successors, (67), 13 states have internal predecessors, (67), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-19 14:59:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 507 transitions. [2023-12-19 14:59:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-19 14:59:37,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:37,985 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:37,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 14:59:37,985 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:37,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:37,986 INFO L85 PathProgramCache]: Analyzing trace with hash -371644274, now seen corresponding path program 1 times [2023-12-19 14:59:37,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:37,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341480375] [2023-12-19 14:59:37,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-19 14:59:38,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:38,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341480375] [2023-12-19 14:59:38,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341480375] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 14:59:38,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545857631] [2023-12-19 14:59:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:38,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 14:59:38,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:59:38,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 14:59:38,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 14:59:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:38,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-19 14:59:38,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 14:59:39,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 49 [2023-12-19 14:59:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-12-19 14:59:39,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 14:59:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-19 14:59:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545857631] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 14:59:39,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 14:59:39,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2023-12-19 14:59:39,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664926589] [2023-12-19 14:59:39,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 14:59:39,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-19 14:59:39,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:39,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-19 14:59:39,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-19 14:59:39,343 INFO L87 Difference]: Start difference. First operand 354 states and 507 transitions. Second operand has 17 states, 14 states have (on average 6.285714285714286) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 6 states have call successors, (41) [2023-12-19 14:59:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:40,261 INFO L93 Difference]: Finished difference Result 1112 states and 1565 transitions. [2023-12-19 14:59:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-19 14:59:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 6.285714285714286) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 6 states have call successors, (41) Word has length 164 [2023-12-19 14:59:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:40,266 INFO L225 Difference]: With dead ends: 1112 [2023-12-19 14:59:40,266 INFO L226 Difference]: Without dead ends: 759 [2023-12-19 14:59:40,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 358 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260 [2023-12-19 14:59:40,268 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 556 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:40,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1267 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 14:59:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-12-19 14:59:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 374. [2023-12-19 14:59:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 317 states have (on average 1.3501577287066246) internal successors, (428), 319 states have internal predecessors, (428), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 14:59:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 524 transitions. [2023-12-19 14:59:40,334 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 524 transitions. Word has length 164 [2023-12-19 14:59:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:40,335 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 524 transitions. [2023-12-19 14:59:40,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 6.285714285714286) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 6 states have call successors, (41) [2023-12-19 14:59:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 524 transitions. [2023-12-19 14:59:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-19 14:59:40,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:40,336 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:40,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 14:59:40,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-19 14:59:40,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:40,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:40,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1189292724, now seen corresponding path program 1 times [2023-12-19 14:59:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:40,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546734187] [2023-12-19 14:59:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:40,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 14:59:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 14:59:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 14:59:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 14:59:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 14:59:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 14:59:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 14:59:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 14:59:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-19 14:59:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-19 14:59:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 14:59:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 14:59:40,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:40,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546734187] [2023-12-19 14:59:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546734187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:40,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 14:59:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420845721] [2023-12-19 14:59:40,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:40,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 14:59:40,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:40,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 14:59:40,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:59:40,653 INFO L87 Difference]: Start difference. First operand 374 states and 524 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 14:59:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:40,712 INFO L93 Difference]: Finished difference Result 751 states and 1055 transitions. [2023-12-19 14:59:40,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 14:59:40,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2023-12-19 14:59:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:40,714 INFO L225 Difference]: With dead ends: 751 [2023-12-19 14:59:40,714 INFO L226 Difference]: Without dead ends: 378 [2023-12-19 14:59:40,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:59:40,715 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:40,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:59:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-12-19 14:59:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2023-12-19 14:59:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 321 states have (on average 1.3457943925233644) internal successors, (432), 323 states have internal predecessors, (432), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 14:59:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 528 transitions. [2023-12-19 14:59:40,765 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 528 transitions. Word has length 164 [2023-12-19 14:59:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:40,765 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 528 transitions. [2023-12-19 14:59:40,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 14:59:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 528 transitions. [2023-12-19 14:59:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-19 14:59:40,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:40,767 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:40,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 14:59:40,767 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:40,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash -766590898, now seen corresponding path program 1 times [2023-12-19 14:59:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:40,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564995146] [2023-12-19 14:59:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:40,790 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 14:59:40,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215659721] [2023-12-19 14:59:40,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:40,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 14:59:40,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:59:40,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 14:59:40,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 14:59:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:59:41,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 14:59:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:59:42,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 14:59:42,204 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 14:59:42,204 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 14:59:42,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 14:59:42,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-19 14:59:42,421 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:42,423 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 14:59:42,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:59:42 BoogieIcfgContainer [2023-12-19 14:59:42,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 14:59:42,513 INFO L158 Benchmark]: Toolchain (without parser) took 17944.28ms. Allocated memory was 245.4MB in the beginning and 528.5MB in the end (delta: 283.1MB). Free memory was 199.3MB in the beginning and 270.9MB in the end (delta: -71.6MB). Peak memory consumption was 212.0MB. Max. memory is 8.0GB. [2023-12-19 14:59:42,513 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 14:59:42,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.23ms. Allocated memory is still 245.4MB. Free memory was 199.3MB in the beginning and 183.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-19 14:59:42,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.04ms. Allocated memory is still 245.4MB. Free memory was 182.5MB in the beginning and 178.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 14:59:42,514 INFO L158 Benchmark]: Boogie Preprocessor took 76.46ms. Allocated memory is still 245.4MB. Free memory was 178.8MB in the beginning and 173.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 14:59:42,514 INFO L158 Benchmark]: RCFGBuilder took 543.88ms. Allocated memory is still 245.4MB. Free memory was 173.6MB in the beginning and 139.0MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-19 14:59:42,515 INFO L158 Benchmark]: TraceAbstraction took 17007.74ms. Allocated memory was 245.4MB in the beginning and 528.5MB in the end (delta: 283.1MB). Free memory was 138.5MB in the beginning and 270.9MB in the end (delta: -132.4MB). Peak memory consumption was 151.2MB. Max. memory is 8.0GB. [2023-12-19 14:59:42,515 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.13ms. Allocated memory is still 192.9MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.23ms. Allocated memory is still 245.4MB. Free memory was 199.3MB in the beginning and 183.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.04ms. Allocated memory is still 245.4MB. Free memory was 182.5MB in the beginning and 178.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 76.46ms. Allocated memory is still 245.4MB. Free memory was 178.8MB in the beginning and 173.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 543.88ms. Allocated memory is still 245.4MB. Free memory was 173.6MB in the beginning and 139.0MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17007.74ms. Allocated memory was 245.4MB in the beginning and 528.5MB in the end (delta: 283.1MB). Free memory was 138.5MB in the beginning and 270.9MB in the end (delta: -132.4MB). Peak memory consumption was 151.2MB. 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 someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L54] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L55] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L55] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L55] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L57] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L58] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L58] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L58] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L60] float_Array_0[0] = __VERIFIER_nondet_float() [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L62] float_Array_0[1] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L64] float_Array_0[2] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L66] float_Array_0[3] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[3] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F [L67] EXPR float_Array_0[3] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] EXPR float_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] CALL assume_abort_if_not(float_Array_0[3] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] RET assume_abort_if_not(float_Array_0[3] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L69] float_Array_0[4] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[4] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F [L70] EXPR float_Array_0[4] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR (float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR (float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] CALL assume_abort_if_not((float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] RET assume_abort_if_not((float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L71] unsigned_long_int_Array_0[0][0][0] = __VERIFIER_nondet_ulong() [L72] EXPR unsigned_long_int_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L72] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR unsigned_long_int_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L74] unsigned_long_int_Array_0[1][0][0] = __VERIFIER_nondet_ulong() [L75] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L77] unsigned_long_int_Array_0[1][1][0] = __VERIFIER_nondet_ulong() [L78] EXPR unsigned_long_int_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR unsigned_long_int_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L80] unsigned_long_int_Array_0[1][0][1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L83] unsigned_long_int_Array_0[0][1][1] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] EXPR unsigned_long_int_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=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, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L98] RET updateVariables() [L99] CALL step() [L34] EXPR unsigned_long_int_Array_0[0][1][1] [L34] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L34] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L34] EXPR unsigned_long_int_Array_0[0][1][1] [L34] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L34] unsigned_long_int_Array_0[1][1][1] = ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))) [L35] EXPR float_Array_0[4] [L35] EXPR float_Array_0[3] [L35] EXPR float_Array_0[2] [L35] EXPR float_Array_0[1] [L35] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L35] COND FALSE !((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) [L38] EXPR unsigned_long_int_Array_0[0][1][1] [L38] EXPR unsigned_long_int_Array_0[1][1][0] [L38] EXPR unsigned_long_int_Array_0[0][0][0] [L38] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L38] EXPR ((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])) [L38] EXPR unsigned_long_int_Array_0[0][1][1] [L38] EXPR ((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L38] unsigned_long_int_Array_0[0][1][0] = ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))) [L39] EXPR float_Array_0[4] [L39] unsigned char stepLocal_0 = (- float_Array_0[4]) != 1.9f; [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, stepLocal_0=0, unsigned_long_int_Array_0={6:0}] [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) [L40] EXPR unsigned_long_int_Array_0[0][0][1] [L40] EXPR unsigned_long_int_Array_0[1][0][0] [L40] EXPR unsigned_long_int_Array_0[1][0][1] [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, stepLocal_0=0, unsigned_long_int_Array_0={6:0}] [L40] COND FALSE !(stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) [L43] EXPR BOOL_unsigned_char_Array_0[1][1] [L43] BOOL_unsigned_char_Array_0[0][1] = BOOL_unsigned_char_Array_0[1][1] [L45] BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0][1]) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR unsigned_long_int_Array_0[1][1][1] [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) [L90] EXPR float_Array_0[4] [L90] EXPR float_Array_0[3] [L90] EXPR float_Array_0[2] [L90] EXPR float_Array_0[1] [L90] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1 [L90] EXPR unsigned_long_int_Array_0[0][0][1] [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90-L91] return ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2905 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2872 mSDsluCounter, 13025 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10568 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5191 IncrementalHoareTripleChecker+Invalid, 5515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 2457 mSDtfsCounter, 5191 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1018 GetRequests, 883 SyntacticMatches, 4 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred in iteration=12, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1180 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2266 NumberOfCodeBlocks, 2266 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2252 ConstructedInterpolants, 0 QuantifiedInterpolants, 10822 SizeOfPredicates, 8 NumberOfNonLiveVariables, 545 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 10496/10640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 14:59:42,574 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...