/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-31.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:29:53,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:29:53,693 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-15 21:29:53,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:29:53,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:29:53,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:29:53,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:29:53,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:29:53,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:29:53,725 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:29:53,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:29:53,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:29:53,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:29:53,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:29:53,727 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:29:53,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:29:53,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:29:53,728 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:29:53,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:29:53,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:29:53,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:29:53,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:29:53,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:29:53,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:29:53,729 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:29:53,729 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:29:53,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:29:53,729 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:29:53,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:29:53,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:29:53,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:29:53,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:29:53,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:29:53,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:29:53,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:29:53,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:29:53,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:29:53,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:29:53,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:29:53,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:29:53,732 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:29:53,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:29:53,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:29:53,732 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-15 21:29:53,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:29:53,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:29:53,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:29:53,953 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:29:53,954 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:29:53,954 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-31.i [2023-12-15 21:29:55,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:29:55,241 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:29:55,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2023-12-15 21:29:55,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c8f6d01/98c0018472f645bdbe639ae9b79bbf0d/FLAG0846513e4 [2023-12-15 21:29:55,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c8f6d01/98c0018472f645bdbe639ae9b79bbf0d [2023-12-15 21:29:55,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:29:55,267 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:29:55,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:29:55,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:29:55,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:29:55,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c93349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55, skipping insertion in model container [2023-12-15 21:29:55,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,298 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:29:55,410 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-31.i[916,929] [2023-12-15 21:29:55,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:29:55,458 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:29:55,466 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-31.i[916,929] [2023-12-15 21:29:55,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:29:55,508 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:29:55,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55 WrapperNode [2023-12-15 21:29:55,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:29:55,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:29:55,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:29:55,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:29:55,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,550 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2023-12-15 21:29:55,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:29:55,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:29:55,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:29:55,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:29:55,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,590 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2023-12-15 21:29:55,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:29:55,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:29:55,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:29:55,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:29:55,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (1/1) ... [2023-12-15 21:29:55,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:29:55,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:55,691 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-15 21:29:55,749 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-15 21:29:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:29:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:29:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:29:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:29:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:29:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:29:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:29:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:29:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:29:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:29:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:29:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:29:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:29:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:29:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:29:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:29:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:29:55,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:29:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:29:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:29:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:29:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:29:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:29:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:29:55,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:29:55,863 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:29:55,864 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:29:56,166 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:29:56,197 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:29:56,197 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:29:56,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:29:56 BoogieIcfgContainer [2023-12-15 21:29:56,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:29:56,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:29:56,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:29:56,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:29:56,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:29:55" (1/3) ... [2023-12-15 21:29:56,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d204938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:29:56, skipping insertion in model container [2023-12-15 21:29:56,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:55" (2/3) ... [2023-12-15 21:29:56,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d204938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:29:56, skipping insertion in model container [2023-12-15 21:29:56,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:29:56" (3/3) ... [2023-12-15 21:29:56,211 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2023-12-15 21:29:56,224 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:29:56,224 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:29:56,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:29:56,277 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;@3ff5b6fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:29:56,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:29:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:29:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-15 21:29:56,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:56,289 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:56,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:56,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1428819053, now seen corresponding path program 1 times [2023-12-15 21:29:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440382464] [2023-12-15 21:29:56,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440382464] [2023-12-15 21:29:56,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-15 21:29:56,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661779668] [2023-12-15 21:29:56,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:56,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:56,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:56,517 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-15 21:29:56,518 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-15 21:29:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-15 21:29:56,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:29:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-15 21:29:56,742 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:29:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661779668] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:56,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:29:56,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182872956] [2023-12-15 21:29:56,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:56,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:29:56,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:56,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:29:56,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:29:56,779 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-15 21:29:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:56,818 INFO L93 Difference]: Finished difference Result 157 states and 251 transitions. [2023-12-15 21:29:56,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:29:56,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2023-12-15 21:29:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:56,826 INFO L225 Difference]: With dead ends: 157 [2023-12-15 21:29:56,827 INFO L226 Difference]: Without dead ends: 78 [2023-12-15 21:29:56,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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-15 21:29:56,832 INFO L413 NwaCegarLoop]: 112 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, 112 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-15 21:29:56,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-15 21:29:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-15 21:29:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:29:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2023-12-15 21:29:56,869 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 89 [2023-12-15 21:29:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:56,870 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2023-12-15 21:29:56,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-15 21:29:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2023-12-15 21:29:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-15 21:29:56,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:56,875 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:56,898 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-15 21:29:57,081 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,SelfDestructingSolverStorable0 [2023-12-15 21:29:57,082 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:57,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:57,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1849607373, now seen corresponding path program 1 times [2023-12-15 21:29:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:57,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72418518] [2023-12-15 21:29:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:57,175 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:29:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957051812] [2023-12-15 21:29:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:57,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:57,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:57,193 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-15 21:29:57,209 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-15 21:29:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:29:57,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:29:57,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2023-12-15 21:29:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:29:57,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:29:57,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:57,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72418518] [2023-12-15 21:29:57,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:29:57,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957051812] [2023-12-15 21:29:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957051812] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:57,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:57,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:29:57,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100594767] [2023-12-15 21:29:57,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:57,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:29:57,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:57,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:29:57,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:29:57,390 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:29:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:57,408 INFO L93 Difference]: Finished difference Result 155 states and 231 transitions. [2023-12-15 21:29:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:29:57,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2023-12-15 21:29:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:57,410 INFO L225 Difference]: With dead ends: 155 [2023-12-15 21:29:57,410 INFO L226 Difference]: Without dead ends: 78 [2023-12-15 21:29:57,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 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-15 21:29:57,411 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:57,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-15 21:29:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-15 21:29:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:29:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 115 transitions. [2023-12-15 21:29:57,417 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 115 transitions. Word has length 89 [2023-12-15 21:29:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:57,418 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 115 transitions. [2023-12-15 21:29:57,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:29:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2023-12-15 21:29:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-15 21:29:57,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:57,420 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:57,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 21:29:57,625 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,SelfDestructingSolverStorable1 [2023-12-15 21:29:57,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:57,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash 828539019, now seen corresponding path program 1 times [2023-12-15 21:29:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:57,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106881434] [2023-12-15 21:29:57,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:57,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:57,667 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:29:57,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604243205] [2023-12-15 21:29:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:57,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:57,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:29:57,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:29:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-15 21:29:57,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:29:57,863 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 31 treesize of output 31 [2023-12-15 21:29:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-15 21:29:57,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:29:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:29:57,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106881434] [2023-12-15 21:29:57,958 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:29:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604243205] [2023-12-15 21:29:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604243205] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:29:57,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:29:57,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-12-15 21:29:57,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584656510] [2023-12-15 21:29:57,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:57,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:29:57,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:57,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:29:57,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:57,961 INFO L87 Difference]: Start difference. First operand 78 states and 115 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:29:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:58,144 INFO L93 Difference]: Finished difference Result 232 states and 340 transitions. [2023-12-15 21:29:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:58,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2023-12-15 21:29:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:58,146 INFO L225 Difference]: With dead ends: 232 [2023-12-15 21:29:58,146 INFO L226 Difference]: Without dead ends: 155 [2023-12-15 21:29:58,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:29:58,147 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 143 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:58,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 500 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-12-15 21:29:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2023-12-15 21:29:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.4144144144144144) internal successors, (157), 112 states have internal predecessors, (157), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:29:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2023-12-15 21:29:58,158 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 89 [2023-12-15 21:29:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:58,158 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2023-12-15 21:29:58,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:29:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2023-12-15 21:29:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-15 21:29:58,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:58,160 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:58,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:29:58,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:58,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:58,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash -165157392, now seen corresponding path program 1 times [2023-12-15 21:29:58,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:58,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575236193] [2023-12-15 21:29:58,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:58,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:58,403 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:29:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078364793] [2023-12-15 21:29:58,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:58,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:58,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:58,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:29:58,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:29:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 21:29:58,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:29:58,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2023-12-15 21:29:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:29:58,659 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:29:58,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:58,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575236193] [2023-12-15 21:29:58,660 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:29:58,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078364793] [2023-12-15 21:29:58,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078364793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:58,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:58,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:29:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096394125] [2023-12-15 21:29:58,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:58,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:29:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:29:58,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:29:58,661 INFO L87 Difference]: Start difference. First operand 132 states and 193 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:29:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:58,677 INFO L93 Difference]: Finished difference Result 299 states and 439 transitions. [2023-12-15 21:29:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:29:58,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-12-15 21:29:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:58,680 INFO L225 Difference]: With dead ends: 299 [2023-12-15 21:29:58,680 INFO L226 Difference]: Without dead ends: 168 [2023-12-15 21:29:58,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-15 21:29:58,681 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 28 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:58,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 215 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-15 21:29:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2023-12-15 21:29:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 112 states have internal predecessors, (155), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:29:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 191 transitions. [2023-12-15 21:29:58,691 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 191 transitions. Word has length 91 [2023-12-15 21:29:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:58,691 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 191 transitions. [2023-12-15 21:29:58,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:29:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 191 transitions. [2023-12-15 21:29:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-15 21:29:58,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:58,693 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:58,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:29:58,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:58,899 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:58,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:58,899 INFO L85 PathProgramCache]: Analyzing trace with hash 514900978, now seen corresponding path program 1 times [2023-12-15 21:29:58,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:58,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126301324] [2023-12-15 21:29:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:58,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:58,920 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:29:58,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860016377] [2023-12-15 21:29:58,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:58,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:58,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:58,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:29:58,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 21:29:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-15 21:29:59,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:29:59,115 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 31 treesize of output 29 [2023-12-15 21:29:59,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:29:59,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2023-12-15 21:29:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-15 21:29:59,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:29:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:29:59,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:59,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126301324] [2023-12-15 21:29:59,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:29:59,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860016377] [2023-12-15 21:29:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860016377] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:29:59,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:29:59,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 15 [2023-12-15 21:29:59,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709446284] [2023-12-15 21:29:59,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:59,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:29:59,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:59,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:29:59,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:29:59,415 INFO L87 Difference]: Start difference. First operand 132 states and 191 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:29:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:59,703 INFO L93 Difference]: Finished difference Result 327 states and 471 transitions. [2023-12-15 21:29:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:29:59,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-12-15 21:29:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:59,707 INFO L225 Difference]: With dead ends: 327 [2023-12-15 21:29:59,707 INFO L226 Difference]: Without dead ends: 196 [2023-12-15 21:29:59,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:29:59,709 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 421 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:59,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 565 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:29:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-15 21:29:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 88. [2023-12-15 21:29:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:29:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2023-12-15 21:29:59,735 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 91 [2023-12-15 21:29:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:59,736 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2023-12-15 21:29:59,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:29:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2023-12-15 21:29:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-15 21:29:59,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:59,737 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:59,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 21:29:59,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:59,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:59,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1367559739, now seen corresponding path program 1 times [2023-12-15 21:29:59,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:59,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479807342] [2023-12-15 21:29:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:59,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:59,960 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:29:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939211567] [2023-12-15 21:29:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:59,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:59,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:59,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:29:59,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 21:30:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 21:30:00,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:30:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:30:00,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:30:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:00,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479807342] [2023-12-15 21:30:00,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:30:00,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939211567] [2023-12-15 21:30:00,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939211567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:00,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:00,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:30:00,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553695069] [2023-12-15 21:30:00,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:00,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:30:00,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:00,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:30:00,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:30:00,139 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:00,158 INFO L93 Difference]: Finished difference Result 176 states and 249 transitions. [2023-12-15 21:30:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:30:00,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-12-15 21:30:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:00,159 INFO L225 Difference]: With dead ends: 176 [2023-12-15 21:30:00,160 INFO L226 Difference]: Without dead ends: 89 [2023-12-15 21:30:00,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-15 21:30:00,161 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 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-15 21:30:00,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-15 21:30:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-15 21:30:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:30:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2023-12-15 21:30:00,186 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 91 [2023-12-15 21:30:00,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:00,188 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2023-12-15 21:30:00,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2023-12-15 21:30:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-15 21:30:00,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:00,190 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:30:00,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 21:30:00,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:00,397 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:00,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1109394301, now seen corresponding path program 1 times [2023-12-15 21:30:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:00,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609941748] [2023-12-15 21:30:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:00,419 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:30:00,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406118319] [2023-12-15 21:30:00,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:00,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:00,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:00,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:30:00,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 21:30:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-15 21:30:00,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:30:00,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 9 [2023-12-15 21:30:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:30:00,613 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:30:00,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:00,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609941748] [2023-12-15 21:30:00,613 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:30:00,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406118319] [2023-12-15 21:30:00,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406118319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:00,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:00,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:00,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238098235] [2023-12-15 21:30:00,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:00,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:00,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:00,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:00,617 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:00,691 INFO L93 Difference]: Finished difference Result 237 states and 330 transitions. [2023-12-15 21:30:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:30:00,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-12-15 21:30:00,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:00,694 INFO L225 Difference]: With dead ends: 237 [2023-12-15 21:30:00,694 INFO L226 Difference]: Without dead ends: 149 [2023-12-15 21:30:00,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:30:00,695 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 89 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:00,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 501 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-15 21:30:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 126. [2023-12-15 21:30:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 110 states have internal predecessors, (149), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-15 21:30:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 175 transitions. [2023-12-15 21:30:00,709 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 175 transitions. Word has length 91 [2023-12-15 21:30:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:00,710 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 175 transitions. [2023-12-15 21:30:00,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2023-12-15 21:30:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-15 21:30:00,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:00,711 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:30:00,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 21:30:00,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:00,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:00,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:00,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1914677027, now seen corresponding path program 1 times [2023-12-15 21:30:00,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:00,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112156667] [2023-12-15 21:30:00,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:00,952 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:30:00,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071510535] [2023-12-15 21:30:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:00,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:00,977 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:30:00,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-15 21:30:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-15 21:30:01,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:30:01,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2023-12-15 21:30:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:30:01,224 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:30:01,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:01,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112156667] [2023-12-15 21:30:01,224 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:30:01,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071510535] [2023-12-15 21:30:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071510535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:01,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:01,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:01,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231242896] [2023-12-15 21:30:01,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:01,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:01,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:01,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:01,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:01,226 INFO L87 Difference]: Start difference. First operand 126 states and 175 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:01,292 INFO L93 Difference]: Finished difference Result 251 states and 343 transitions. [2023-12-15 21:30:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:30:01,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2023-12-15 21:30:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:01,294 INFO L225 Difference]: With dead ends: 251 [2023-12-15 21:30:01,294 INFO L226 Difference]: Without dead ends: 126 [2023-12-15 21:30:01,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:30:01,295 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 74 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:01,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 410 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-15 21:30:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2023-12-15 21:30:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:30:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2023-12-15 21:30:01,301 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 92 [2023-12-15 21:30:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:01,301 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2023-12-15 21:30:01,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2023-12-15 21:30:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:30:01,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:01,302 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:30:01,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 21:30:01,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-15 21:30:01,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:01,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:01,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1630731815, now seen corresponding path program 1 times [2023-12-15 21:30:01,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:01,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971019807] [2023-12-15 21:30:01,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:01,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:01,534 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:30:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953875676] [2023-12-15 21:30:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:01,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:01,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:01,536 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:30:01,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-15 21:30:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-15 21:30:01,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:30:01,742 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 17 treesize of output 17 [2023-12-15 21:30:01,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:30:01,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 28 [2023-12-15 21:30:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-15 21:30:01,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:30:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:30:01,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971019807] [2023-12-15 21:30:01,864 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:30:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953875676] [2023-12-15 21:30:01,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953875676] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:30:01,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:30:01,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2023-12-15 21:30:01,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043418404] [2023-12-15 21:30:01,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:01,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:30:01,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:01,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:30:01,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:01,867 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:02,030 INFO L93 Difference]: Finished difference Result 281 states and 380 transitions. [2023-12-15 21:30:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:30:02,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 93 [2023-12-15 21:30:02,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:02,032 INFO L225 Difference]: With dead ends: 281 [2023-12-15 21:30:02,032 INFO L226 Difference]: Without dead ends: 189 [2023-12-15 21:30:02,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:30:02,033 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 174 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:02,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 602 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-12-15 21:30:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2023-12-15 21:30:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 151 states have (on average 1.3245033112582782) internal successors, (200), 152 states have internal predecessors, (200), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:30:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 240 transitions. [2023-12-15 21:30:02,044 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 240 transitions. Word has length 93 [2023-12-15 21:30:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:02,044 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 240 transitions. [2023-12-15 21:30:02,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:02,044 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 240 transitions. [2023-12-15 21:30:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:30:02,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:02,045 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:30:02,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-15 21:30:02,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:02,251 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:02,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1893533739, now seen corresponding path program 1 times [2023-12-15 21:30:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385156964] [2023-12-15 21:30:02,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:02,283 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:30:02,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637555556] [2023-12-15 21:30:02,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:02,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:02,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:02,292 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:30:02,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-15 21:30:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:02,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 21:30:02,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:30:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:30:02,507 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:30:02,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:02,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385156964] [2023-12-15 21:30:02,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:30:02,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637555556] [2023-12-15 21:30:02,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637555556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:02,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:02,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:02,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891164993] [2023-12-15 21:30:02,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:02,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:02,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:02,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:02,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:02,509 INFO L87 Difference]: Start difference. First operand 178 states and 240 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:02,603 INFO L93 Difference]: Finished difference Result 479 states and 650 transitions. [2023-12-15 21:30:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:30:02,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-15 21:30:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:02,605 INFO L225 Difference]: With dead ends: 479 [2023-12-15 21:30:02,605 INFO L226 Difference]: Without dead ends: 302 [2023-12-15 21:30:02,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:30:02,606 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 107 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:02,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 463 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-12-15 21:30:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 186. [2023-12-15 21:30:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 160 states have internal predecessors, (208), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:30:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 248 transitions. [2023-12-15 21:30:02,617 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 248 transitions. Word has length 94 [2023-12-15 21:30:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:02,617 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 248 transitions. [2023-12-15 21:30:02,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 248 transitions. [2023-12-15 21:30:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:30:02,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:02,618 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:30:02,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-15 21:30:02,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 21:30:02,824 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:02,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1442203541, now seen corresponding path program 1 times [2023-12-15 21:30:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023823911] [2023-12-15 21:30:02,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:02,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:02,860 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:30:02,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718259039] [2023-12-15 21:30:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:02,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:02,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:02,866 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:30:02,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-15 21:30:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 21:30:03,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:30:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:30:03,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:30:03,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:03,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023823911] [2023-12-15 21:30:03,049 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:30:03,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718259039] [2023-12-15 21:30:03,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718259039] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:03,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:03,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:03,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52215820] [2023-12-15 21:30:03,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:03,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:03,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:03,051 INFO L87 Difference]: Start difference. First operand 186 states and 248 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:03,095 INFO L93 Difference]: Finished difference Result 420 states and 562 transitions. [2023-12-15 21:30:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:30:03,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-15 21:30:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:03,097 INFO L225 Difference]: With dead ends: 420 [2023-12-15 21:30:03,097 INFO L226 Difference]: Without dead ends: 235 [2023-12-15 21:30:03,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 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-15 21:30:03,098 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 60 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:03,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 474 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-12-15 21:30:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 188. [2023-12-15 21:30:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 161 states have (on average 1.3043478260869565) internal successors, (210), 162 states have internal predecessors, (210), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:30:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 250 transitions. [2023-12-15 21:30:03,110 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 250 transitions. Word has length 94 [2023-12-15 21:30:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:03,110 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 250 transitions. [2023-12-15 21:30:03,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 250 transitions. [2023-12-15 21:30:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:30:03,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:03,111 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:30:03,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-15 21:30:03,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-15 21:30:03,317 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:03,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:03,317 INFO L85 PathProgramCache]: Analyzing trace with hash -100501525, now seen corresponding path program 1 times [2023-12-15 21:30:03,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:03,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562547373] [2023-12-15 21:30:03,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:03,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:03,355 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:30:03,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627378726] [2023-12-15 21:30:03,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:03,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:03,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:03,362 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:30:03,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-15 21:30:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-15 21:30:03,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:30:03,578 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 19 treesize of output 19 [2023-12-15 21:30:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-15 21:30:03,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:30:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:30:03,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:03,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562547373] [2023-12-15 21:30:03,666 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:30:03,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627378726] [2023-12-15 21:30:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627378726] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:30:03,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:30:03,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2023-12-15 21:30:03,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810391450] [2023-12-15 21:30:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:03,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:30:03,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:30:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:03,667 INFO L87 Difference]: Start difference. First operand 188 states and 250 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:03,790 INFO L93 Difference]: Finished difference Result 549 states and 728 transitions. [2023-12-15 21:30:03,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:30:03,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-15 21:30:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:03,792 INFO L225 Difference]: With dead ends: 549 [2023-12-15 21:30:03,792 INFO L226 Difference]: Without dead ends: 362 [2023-12-15 21:30:03,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:30:03,793 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 129 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:03,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 775 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2023-12-15 21:30:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 196. [2023-12-15 21:30:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 170 states have internal predecessors, (222), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:30:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 262 transitions. [2023-12-15 21:30:03,805 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 262 transitions. Word has length 94 [2023-12-15 21:30:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:03,805 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 262 transitions. [2023-12-15 21:30:03,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 262 transitions. [2023-12-15 21:30:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:30:03,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:03,806 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:30:03,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-15 21:30:04,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 21:30:04,013 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:04,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:04,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1380365203, now seen corresponding path program 1 times [2023-12-15 21:30:04,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:04,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275001737] [2023-12-15 21:30:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:04,031 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:30:04,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097496896] [2023-12-15 21:30:04,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:04,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:04,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:04,033 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:30:04,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-15 21:30:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:30:04,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:30:04,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 48 treesize of output 30 [2023-12-15 21:30:04,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 9 [2023-12-15 21:30:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:30:04,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:30:04,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:04,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275001737] [2023-12-15 21:30:04,306 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:30:04,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097496896] [2023-12-15 21:30:04,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097496896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:04,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:04,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257373386] [2023-12-15 21:30:04,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:04,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:04,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:04,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:04,307 INFO L87 Difference]: Start difference. First operand 196 states and 262 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:04,447 INFO L93 Difference]: Finished difference Result 543 states and 720 transitions. [2023-12-15 21:30:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:30:04,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-15 21:30:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:04,449 INFO L225 Difference]: With dead ends: 543 [2023-12-15 21:30:04,449 INFO L226 Difference]: Without dead ends: 348 [2023-12-15 21:30:04,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:30:04,450 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 100 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:04,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 475 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-12-15 21:30:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 184. [2023-12-15 21:30:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 158 states have internal predecessors, (204), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:30:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2023-12-15 21:30:04,461 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 94 [2023-12-15 21:30:04,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:04,462 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2023-12-15 21:30:04,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2023-12-15 21:30:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:30:04,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:04,463 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:30:04,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-15 21:30:04,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-15 21:30:04,669 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:04,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash -77249074, now seen corresponding path program 1 times [2023-12-15 21:30:04,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:04,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079101803] [2023-12-15 21:30:04,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:04,698 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:30:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190552624] [2023-12-15 21:30:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:04,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:04,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:04,701 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:30:04,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-15 21:30:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-15 21:30:04,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:30:04,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-15 21:30:04,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:30:04,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2023-12-15 21:30:04,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:30:04,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 75 [2023-12-15 21:30:05,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 114 treesize of output 84 [2023-12-15 21:30:05,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:30:05,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 30 [2023-12-15 21:30:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:30:05,178 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:30:05,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:05,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079101803] [2023-12-15 21:30:05,179 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:30:05,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190552624] [2023-12-15 21:30:05,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190552624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:05,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:05,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:30:05,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110926335] [2023-12-15 21:30:05,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:05,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:30:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:05,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:30:05,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:05,180 INFO L87 Difference]: Start difference. First operand 184 states and 244 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:05,416 INFO L93 Difference]: Finished difference Result 481 states and 640 transitions. [2023-12-15 21:30:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:30:05,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-15 21:30:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:05,418 INFO L225 Difference]: With dead ends: 481 [2023-12-15 21:30:05,418 INFO L226 Difference]: Without dead ends: 298 [2023-12-15 21:30:05,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:30:05,419 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 182 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:05,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 760 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-15 21:30:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 217. [2023-12-15 21:30:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 190 states have (on average 1.2947368421052632) internal successors, (246), 191 states have internal predecessors, (246), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:30:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 286 transitions. [2023-12-15 21:30:05,430 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 286 transitions. Word has length 94 [2023-12-15 21:30:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:05,430 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 286 transitions. [2023-12-15 21:30:05,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 286 transitions. [2023-12-15 21:30:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:30:05,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:05,431 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:30:05,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-15 21:30:05,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:05,642 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:05,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1139807065, now seen corresponding path program 1 times [2023-12-15 21:30:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:05,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323870651] [2023-12-15 21:30:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:05,661 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:30:05,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601567716] [2023-12-15 21:30:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:05,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:05,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:05,662 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:30:05,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-15 21:30:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:05,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:30:05,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:30:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-15 21:30:05,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:30:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323870651] [2023-12-15 21:30:05,857 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:30:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601567716] [2023-12-15 21:30:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601567716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:05,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:05,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:30:05,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866594782] [2023-12-15 21:30:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:05,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:30:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:05,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:30:05,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:30:05,858 INFO L87 Difference]: Start difference. First operand 217 states and 286 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:05,907 INFO L93 Difference]: Finished difference Result 457 states and 605 transitions. [2023-12-15 21:30:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:30:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2023-12-15 21:30:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:05,909 INFO L225 Difference]: With dead ends: 457 [2023-12-15 21:30:05,909 INFO L226 Difference]: Without dead ends: 241 [2023-12-15 21:30:05,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:05,909 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 61 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:05,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 513 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:05,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-12-15 21:30:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 222. [2023-12-15 21:30:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 195 states have (on average 1.2871794871794873) internal successors, (251), 196 states have internal predecessors, (251), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:30:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 291 transitions. [2023-12-15 21:30:05,918 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 291 transitions. Word has length 95 [2023-12-15 21:30:05,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:05,918 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 291 transitions. [2023-12-15 21:30:05,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-15 21:30:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 291 transitions. [2023-12-15 21:30:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:30:05,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:05,918 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:30:05,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-15 21:30:06,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-15 21:30:06,124 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:06,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1406435230, now seen corresponding path program 1 times [2023-12-15 21:30:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:06,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231112613] [2023-12-15 21:30:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:06,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:06,141 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:30:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184698208] [2023-12-15 21:30:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:06,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:30:06,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:06,142 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:30:06,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-15 21:30:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:30:06,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:30:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:30:06,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:30:06,556 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:30:06,557 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:30:06,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-15 21:30:06,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-15 21:30:06,768 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:06,770 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:30:06,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:30:06 BoogieIcfgContainer [2023-12-15 21:30:06,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:30:06,838 INFO L158 Benchmark]: Toolchain (without parser) took 11570.85ms. Allocated memory was 202.4MB in the beginning and 421.5MB in the end (delta: 219.2MB). Free memory was 140.5MB in the beginning and 371.1MB in the end (delta: -230.5MB). Peak memory consumption was 218.0MB. Max. memory is 8.0GB. [2023-12-15 21:30:06,838 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:30:06,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.87ms. Allocated memory is still 202.4MB. Free memory was 140.2MB in the beginning and 125.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:30:06,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.65ms. Allocated memory is still 202.4MB. Free memory was 125.8MB in the beginning and 122.1MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:30:06,838 INFO L158 Benchmark]: Boogie Preprocessor took 73.52ms. Allocated memory is still 202.4MB. Free memory was 122.1MB in the beginning and 117.8MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:30:06,839 INFO L158 Benchmark]: RCFGBuilder took 572.61ms. Allocated memory was 202.4MB in the beginning and 293.6MB in the end (delta: 91.2MB). Free memory was 117.5MB in the beginning and 231.4MB in the end (delta: -114.0MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2023-12-15 21:30:06,839 INFO L158 Benchmark]: TraceAbstraction took 10637.86ms. Allocated memory was 293.6MB in the beginning and 421.5MB in the end (delta: 127.9MB). Free memory was 230.9MB in the beginning and 371.1MB in the end (delta: -140.2MB). Peak memory consumption was 216.3MB. Max. memory is 8.0GB. [2023-12-15 21:30:06,840 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.87ms. Allocated memory is still 202.4MB. Free memory was 140.2MB in the beginning and 125.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.65ms. Allocated memory is still 202.4MB. Free memory was 125.8MB in the beginning and 122.1MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.52ms. Allocated memory is still 202.4MB. Free memory was 122.1MB in the beginning and 117.8MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 572.61ms. Allocated memory was 202.4MB in the beginning and 293.6MB in the end (delta: 91.2MB). Free memory was 117.5MB in the beginning and 231.4MB in the end (delta: -114.0MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * TraceAbstraction took 10637.86ms. Allocated memory was 293.6MB in the beginning and 421.5MB in the end (delta: 127.9MB). Free memory was 230.9MB in the beginning and 371.1MB in the end (delta: -140.2MB). Peak memory consumption was 216.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L34] double last_1_double_Array_0_0_ = 0.97; [L35] signed long int last_1_signed_long_int_Array_0_1__0_ = 4; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR double_Array_0[0] [L94] last_1_double_Array_0_0_ = double_Array_0[0] [L95] EXPR signed_long_int_Array_0[1][0] [L95] last_1_signed_long_int_Array_0_1__0_ = signed_long_int_Array_0[1][0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L84] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] signed_long_int_Array_0[0][1] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L106] RET updateVariables() [L107] CALL step() [L39] EXPR signed_long_int_Array_0[0][1] [L39] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] COND FALSE !(! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) [L46] EXPR unsigned_char_Array_0[0] [L46] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L48] EXPR unsigned_char_Array_0[1] [L48] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L48] COND FALSE !(unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0][1] [L51] signed_long_int_Array_0[1][0] = (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]) [L53] EXPR unsigned_char_Array_0[1] [L53] EXPR signed_long_int_Array_0[0][1] [L53] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L53] COND FALSE !((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) [L64] EXPR double_Array_0[1] [L64] double_Array_0[0] = double_Array_0[1] [L66] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] COND TRUE BOOL_unsigned_char_Array_0[1] [L67] EXPR signed_long_int_Array_0[0][1] [L67] EXPR unsigned_char_Array_0[1] [L67] EXPR unsigned_char_Array_0[1] [L67] signed_long_int_Array_0[1][1] = ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) [L98] EXPR signed_long_int_Array_0[1][1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) [L98] EXPR signed_long_int_Array_0[1][0] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[0] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L98] EXPR double_Array_0[0] [L98] EXPR double_Array_0[1] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98-L99] return (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 16, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1568 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1568 mSDsluCounter, 6796 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4790 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1131 IncrementalHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 2006 mSDtfsCounter, 1131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1758 GetRequests, 1665 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=15, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 827 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1565 NumberOfCodeBlocks, 1565 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1729 ConstructedInterpolants, 0 QuantifiedInterpolants, 4134 SizeOfPredicates, 112 NumberOfNonLiveVariables, 5323 ConjunctsInSsa, 191 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 4060/4180 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-15 21:30:06,862 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...