/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_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursified_nla-digbench/recursified_sqrt1-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:08:17,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:08:17,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 07:08:17,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:08:17,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:08:17,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:08:17,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:08:17,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:08:17,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:08:17,988 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:08:17,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:08:17,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:08:17,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:08:17,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:08:17,989 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:08:17,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:08:17,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:08:17,990 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:08:17,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:08:17,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:08:17,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:08:17,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:08:17,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:08:17,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:08:17,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:08:17,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:08:17,992 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:08:17,992 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:08:17,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:08:17,992 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:08:17,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:08:17,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:08:17,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:08:17,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:08:17,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:08:17,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:08:17,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:08:17,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:08:17,994 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:08:17,994 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:08:17,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:08:17,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:08:17,994 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:08:17,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:08:17,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:08:17,995 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:08:17,995 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 [2023-12-25 07:08:18,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:08:18,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:08:18,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:08:18,184 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:08:18,184 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:08:18,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_nla-digbench/recursified_sqrt1-ll.c [2023-12-25 07:08:19,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:08:19,415 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:08:19,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_sqrt1-ll.c [2023-12-25 07:08:19,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4462b92/d1c5e1c0c8534276a6ec2181d6c95618/FLAG1dece844f [2023-12-25 07:08:19,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4462b92/d1c5e1c0c8534276a6ec2181d6c95618 [2023-12-25 07:08:19,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:08:19,439 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:08:19,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:08:19,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:08:19,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:08:19,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d21074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19, skipping insertion in model container [2023-12-25 07:08:19,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,461 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:08:19,573 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_sqrt1-ll.c[1052,1065] [2023-12-25 07:08:19,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:08:19,599 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:08:19,607 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_sqrt1-ll.c[1052,1065] [2023-12-25 07:08:19,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:08:19,623 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:08:19,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19 WrapperNode [2023-12-25 07:08:19,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:08:19,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:08:19,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:08:19,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:08:19,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,654 INFO L138 Inliner]: procedures = 20, calls = 58, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2023-12-25 07:08:19,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:08:19,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:08:19,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:08:19,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:08:19,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,675 INFO L175 MemorySlicer]: Split 33 memory accesses to 5 slices as follows [2, 12, 8, 9, 2]. 36 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 7 writes are split as follows [0, 2, 2, 2, 1]. [2023-12-25 07:08:19,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:08:19,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:08:19,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:08:19,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:08:19,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (1/1) ... [2023-12-25 07:08:19,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:08:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:08:19,709 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-25 07:08:19,719 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-25 07:08:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:08:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:08:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 07:08:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 07:08:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 07:08:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 07:08:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 07:08:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-25 07:08:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-25 07:08:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-25 07:08:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-25 07:08:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#4 [2023-12-25 07:08:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 07:08:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 07:08:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 07:08:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 07:08:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 07:08:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_29_to_40_0 [2023-12-25 07:08:19,741 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_29_to_40_0 [2023-12-25 07:08:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:08:19,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:08:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-25 07:08:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-25 07:08:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-25 07:08:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-25 07:08:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#4 [2023-12-25 07:08:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 07:08:19,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 07:08:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 07:08:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 07:08:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 07:08:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 07:08:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 07:08:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 07:08:19,828 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:08:19,829 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:08:20,010 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:08:20,033 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:08:20,033 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 07:08:20,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:08:20 BoogieIcfgContainer [2023-12-25 07:08:20,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:08:20,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:08:20,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:08:20,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:08:20,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:08:19" (1/3) ... [2023-12-25 07:08:20,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a489053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:08:20, skipping insertion in model container [2023-12-25 07:08:20,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:19" (2/3) ... [2023-12-25 07:08:20,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a489053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:08:20, skipping insertion in model container [2023-12-25 07:08:20,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:08:20" (3/3) ... [2023-12-25 07:08:20,039 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_sqrt1-ll.c [2023-12-25 07:08:20,051 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:08:20,066 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:08:20,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:08:20,100 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;@6d7bace0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:08:20,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:08:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 07:08:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 07:08:20,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:20,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:20,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:20,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1408384077, now seen corresponding path program 1 times [2023-12-25 07:08:20,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:20,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820279634] [2023-12-25 07:08:20,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:20,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:08:20,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:20,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:08:20,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 07:08:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:20,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 07:08:20,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:20,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 07:08:20,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:08:20,295 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:08:20,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:08:20,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:08:20,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2023-12-25 07:08:20,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:08:20,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2023-12-25 07:08:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:08:20,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:20,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:20,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820279634] [2023-12-25 07:08:20,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820279634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:20,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:20,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 07:08:20,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349831456] [2023-12-25 07:08:20,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:20,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:08:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:20,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:08:20,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:08:20,550 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:08:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:21,726 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2023-12-25 07:08:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:08:21,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-25 07:08:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:21,734 INFO L225 Difference]: With dead ends: 76 [2023-12-25 07:08:21,734 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 07:08:21,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 07:08:21,740 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:21,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 107 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 07:08:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 07:08:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2023-12-25 07:08:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 07:08:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2023-12-25 07:08:21,780 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 8 [2023-12-25 07:08:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:21,781 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2023-12-25 07:08:21,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:08:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2023-12-25 07:08:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 07:08:21,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:21,782 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:21,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:21,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:08:21,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:21,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:21,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1735781632, now seen corresponding path program 1 times [2023-12-25 07:08:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514645787] [2023-12-25 07:08:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:21,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:08:21,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:21,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:08:22,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 07:08:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:22,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 07:08:22,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:22,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 07:08:22,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:08:22,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:08:22,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:08:22,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:08:22,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2023-12-25 07:08:22,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:08:22,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2023-12-25 07:08:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:08:22,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:08:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:08:30,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514645787] [2023-12-25 07:08:30,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514645787] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:08:30,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:08:30,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2023-12-25 07:08:30,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488183280] [2023-12-25 07:08:30,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:30,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:08:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:30,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:08:30,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-25 07:08:30,863 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 07:08:49,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:08:56,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:09:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:09:05,220 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2023-12-25 07:09:05,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:09:05,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-25 07:09:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:09:05,230 INFO L225 Difference]: With dead ends: 53 [2023-12-25 07:09:05,230 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 07:09:05,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-12-25 07:09:05,231 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:09:05,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 109 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 23.7s Time] [2023-12-25 07:09:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 07:09:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2023-12-25 07:09:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 07:09:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2023-12-25 07:09:05,251 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 14 [2023-12-25 07:09:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:09:05,251 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2023-12-25 07:09:05,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 07:09:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2023-12-25 07:09:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-25 07:09:05,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:09:05,252 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:09:05,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 07:09:05,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:09:05,457 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:09:05,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:09:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1054740085, now seen corresponding path program 1 times [2023-12-25 07:09:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:09:05,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31177018] [2023-12-25 07:09:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:09:05,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:09:05,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:09:05,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:09:05,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 07:11:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:11:32,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-25 07:11:32,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:11:32,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 07:11:32,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:11:32,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2023-12-25 07:11:32,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2023-12-25 07:11:33,477 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-25 07:11:33,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 38 [2023-12-25 07:11:38,107 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-12-25 07:11:38,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 120 treesize of output 60 [2023-12-25 07:11:38,151 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-25 07:11:38,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 39 [2023-12-25 07:11:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:11:41,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:13:27,309 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse6 (select |c_#memory_int#3| c_func_to_recursive_line_29_to_40_0_~a.base))) (concat (select .cse6 (bvadd (_ bv4 32) c_func_to_recursive_line_29_to_40_0_~a.offset)) (select .cse6 c_func_to_recursive_line_29_to_40_0_~a.offset))))) (let ((.cse1 (let ((.cse5 (select |c_#memory_int#1| c_func_to_recursive_line_29_to_40_0_~t.base))) (concat (select .cse5 (bvadd (_ bv4 32) c_func_to_recursive_line_29_to_40_0_~t.offset)) (select .cse5 c_func_to_recursive_line_29_to_40_0_~t.offset)))) (.cse2 (let ((.cse4 (select |c_#memory_int#2| c_func_to_recursive_line_29_to_40_0_~s.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_func_to_recursive_line_29_to_40_0_~s.offset)) (select .cse4 c_func_to_recursive_line_29_to_40_0_~s.offset)))) (.cse0 (bvmul (_ bv2 64) .cse3))) (or (not (= (bvadd (_ bv1 64) .cse0) .cse1)) (= (_ bv0 64) (bvadd (bvneg (bvmul .cse2 (_ bv4 64))) (_ bv1 64) (bvmul .cse1 .cse1) (bvmul (_ bv2 64) .cse1))) (not (= .cse2 (bvadd (_ bv1 64) .cse0 (bvmul .cse3 .cse3))))))) is different from true [2023-12-25 07:13:44,268 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse6 (select |c_#memory_int#3| |c_func_to_recursive_line_29_to_40_0_#in~a.base|))) (concat (select .cse6 (bvadd (_ bv4 32) |c_func_to_recursive_line_29_to_40_0_#in~a.offset|)) (select .cse6 |c_func_to_recursive_line_29_to_40_0_#in~a.offset|))))) (let ((.cse0 (let ((.cse5 (select |c_#memory_int#1| |c_func_to_recursive_line_29_to_40_0_#in~t.base|))) (concat (select .cse5 (bvadd (_ bv4 32) |c_func_to_recursive_line_29_to_40_0_#in~t.offset|)) (select .cse5 |c_func_to_recursive_line_29_to_40_0_#in~t.offset|)))) (.cse2 (let ((.cse4 (select |c_#memory_int#2| |c_func_to_recursive_line_29_to_40_0_#in~s.base|))) (concat (select .cse4 (bvadd (_ bv4 32) |c_func_to_recursive_line_29_to_40_0_#in~s.offset|)) (select .cse4 |c_func_to_recursive_line_29_to_40_0_#in~s.offset|)))) (.cse1 (bvmul (_ bv2 64) .cse3))) (or (not (= .cse0 (bvadd (_ bv1 64) .cse1))) (= (_ bv0 64) (bvadd (bvmul .cse0 .cse0) (bvmul (_ bv2 64) .cse0) (_ bv1 64) (bvneg (bvmul .cse2 (_ bv4 64))))) (not (= .cse2 (bvadd (bvmul .cse3 .cse3) (_ bv1 64) .cse1)))))) is different from true [2023-12-25 07:14:01,151 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse6 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#a~0#1.base|))) (concat (select .cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#a~0#1.offset|)) (select .cse6 |c_ULTIMATE.start_main_~#a~0#1.offset|))))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#s~0#1.base|))) (concat (select .cse5 (bvadd |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv4 32))) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse0 (bvmul (_ bv2 64) .cse1)) (.cse3 (let ((.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#t~0#1.base|))) (concat (select .cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#t~0#1.offset|)) (select .cse4 |c_ULTIMATE.start_main_~#t~0#1.offset|))))) (or (not (= (bvadd (_ bv1 64) .cse0 (bvmul .cse1 .cse1)) .cse2)) (= (_ bv0 64) (bvadd (bvneg (bvmul (_ bv4 64) .cse2)) (_ bv1 64) (bvmul .cse3 .cse3) (bvmul (_ bv2 64) .cse3))) (not (= (bvadd (_ bv1 64) .cse0) .cse3))))) is different from true [2023-12-25 07:14:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 3 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 07:14:01,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:14:01,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31177018] [2023-12-25 07:14:01,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31177018] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:14:01,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:14:01,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2023-12-25 07:14:01,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520856561] [2023-12-25 07:14:01,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:14:01,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 07:14:01,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:14:01,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 07:14:01,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=693, Unknown=8, NotChecked=168, Total=992 [2023-12-25 07:14:01,155 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 07:15:04,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:15:19,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 07:15:32,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 07:15:52,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 07:15:56,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 07:16:03,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 07:16:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:03,953 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2023-12-25 07:16:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 07:16:03,956 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 1.125) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2023-12-25 07:16:03,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:03,958 INFO L225 Difference]: With dead ends: 64 [2023-12-25 07:16:03,958 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 07:16:03,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 144.5s TimeCoverageRelationStatistics Valid=274, Invalid=1369, Unknown=9, NotChecked=240, Total=1892 [2023-12-25 07:16:03,965 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 31 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 75.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:03,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 121 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 370 Invalid, 4 Unknown, 192 Unchecked, 75.1s Time] [2023-12-25 07:16:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 07:16:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2023-12-25 07:16:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2023-12-25 07:16:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2023-12-25 07:16:03,983 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 20 [2023-12-25 07:16:03,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:03,983 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2023-12-25 07:16:03,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 1.125) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 07:16:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2023-12-25 07:16:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 07:16:03,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:03,984 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:04,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 07:16:04,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:04,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:04,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1398908834, now seen corresponding path program 1 times [2023-12-25 07:16:04,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:04,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191374486] [2023-12-25 07:16:04,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:04,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:04,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:04,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 07:16:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:04,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-25 07:16:04,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:04,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 07:16:04,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:16:04,598 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:16:04,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:16:06,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:06,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 33 [2023-12-25 07:16:06,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:06,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 33 [2023-12-25 07:16:06,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:06,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2023-12-25 07:16:06,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:06,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2023-12-25 07:16:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 07:16:06,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:16:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 07:16:08,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:08,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191374486] [2023-12-25 07:16:08,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191374486] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:16:08,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:16:08,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2023-12-25 07:16:08,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955815549] [2023-12-25 07:16:08,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:16:08,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 07:16:08,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:08,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 07:16:08,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-12-25 07:16:08,174 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 17 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 07:16:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:14,813 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2023-12-25 07:16:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 07:16:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2023-12-25 07:16:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:14,816 INFO L225 Difference]: With dead ends: 85 [2023-12-25 07:16:14,816 INFO L226 Difference]: Without dead ends: 83 [2023-12-25 07:16:14,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2023-12-25 07:16:14,817 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 66 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:14,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 190 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-25 07:16:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-25 07:16:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2023-12-25 07:16:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.1) internal successors, (55), 53 states have internal predecessors, (55), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (22), 18 states have call predecessors, (22), 16 states have call successors, (22) [2023-12-25 07:16:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2023-12-25 07:16:14,850 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 30 [2023-12-25 07:16:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:14,851 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2023-12-25 07:16:14,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 07:16:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2023-12-25 07:16:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 07:16:14,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:14,852 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:14,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 07:16:15,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:15,053 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:15,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1438102184, now seen corresponding path program 1 times [2023-12-25 07:16:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:15,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206293779] [2023-12-25 07:16:15,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:15,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:15,057 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:15,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 07:16:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:15,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:16:15,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:16,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:16,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 25 [2023-12-25 07:16:16,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:16,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2023-12-25 07:16:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:16:16,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:16:26,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:26,834 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 64 treesize of output 92 [2023-12-25 07:16:27,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:27,065 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 44 treesize of output 72 [2023-12-25 07:16:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 07:16:30,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:30,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206293779] [2023-12-25 07:16:30,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206293779] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:16:30,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:16:30,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2023-12-25 07:16:30,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998694652] [2023-12-25 07:16:30,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:16:30,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 07:16:30,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:30,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 07:16:30,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=289, Unknown=2, NotChecked=0, Total=342 [2023-12-25 07:16:30,934 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 19 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-25 07:16:37,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:16:41,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:16:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:43,374 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2023-12-25 07:16:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 07:16:43,379 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) Word has length 30 [2023-12-25 07:16:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:43,380 INFO L225 Difference]: With dead ends: 91 [2023-12-25 07:16:43,380 INFO L226 Difference]: Without dead ends: 89 [2023-12-25 07:16:43,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=107, Invalid=541, Unknown=2, NotChecked=0, Total=650 [2023-12-25 07:16:43,381 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:43,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 88 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 252 Invalid, 1 Unknown, 0 Unchecked, 11.3s Time] [2023-12-25 07:16:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-25 07:16:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-25 07:16:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 59 states have internal predecessors, (61), 18 states have call successors, (18), 11 states have call predecessors, (18), 14 states have return successors, (22), 18 states have call predecessors, (22), 16 states have call successors, (22) [2023-12-25 07:16:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2023-12-25 07:16:43,404 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 30 [2023-12-25 07:16:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:43,404 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-12-25 07:16:43,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-25 07:16:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2023-12-25 07:16:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 07:16:43,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:43,406 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:43,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:43,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:43,613 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:43,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:43,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1912282705, now seen corresponding path program 2 times [2023-12-25 07:16:43,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:43,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921837389] [2023-12-25 07:16:43,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:16:43,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:43,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:43,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:43,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 07:16:43,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:16:43,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:16:43,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-25 07:16:43,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:44,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 07:16:44,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:16:44,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 07:16:44,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:16:44,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:16:44,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:16:46,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:46,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 89 [2023-12-25 07:16:46,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:46,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 61 [2023-12-25 07:16:46,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:46,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 33 [2023-12-25 07:16:47,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:47,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2023-12-25 07:16:47,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:16:47,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2023-12-25 07:16:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 07:16:47,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:17:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 07:17:20,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:17:20,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921837389] [2023-12-25 07:17:20,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921837389] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:17:20,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:17:20,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2023-12-25 07:17:20,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606143402] [2023-12-25 07:17:20,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:17:20,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 07:17:20,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:17:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 07:17:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-12-25 07:17:20,937 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 20 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (14), 9 states have call predecessors, (14), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 07:18:43,989 WARN L293 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 07:19:11,426 WARN L293 SmtUtils]: Spent 7.36s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 07:19:20,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:19:52,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:19:54,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:19:57,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:20:00,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:20:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:02,930 INFO L93 Difference]: Finished difference Result 149 states and 168 transitions. [2023-12-25 07:20:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 07:20:02,948 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (14), 9 states have call predecessors, (14), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 36 [2023-12-25 07:20:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:02,949 INFO L225 Difference]: With dead ends: 149 [2023-12-25 07:20:02,949 INFO L226 Difference]: Without dead ends: 147 [2023-12-25 07:20:02,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 132.7s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 07:20:02,952 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 142 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 71 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:02,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 282 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 522 Invalid, 1 Unknown, 0 Unchecked, 58.9s Time] [2023-12-25 07:20:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-25 07:20:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2023-12-25 07:20:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 95 states have internal predecessors, (98), 29 states have call successors, (29), 18 states have call predecessors, (29), 23 states have return successors, (36), 29 states have call predecessors, (36), 26 states have call successors, (36) [2023-12-25 07:20:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2023-12-25 07:20:02,999 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 36 [2023-12-25 07:20:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:03,001 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2023-12-25 07:20:03,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (14), 9 states have call predecessors, (14), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 07:20:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2023-12-25 07:20:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 07:20:03,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:03,003 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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-25 07:20:03,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 07:20:03,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:20:03,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:03,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:03,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1300709659, now seen corresponding path program 1 times [2023-12-25 07:20:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901386499] [2023-12-25 07:20:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:03,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:20:03,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:03,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:20:03,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 07:20:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:14,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-25 07:20:14,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:14,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 07:20:14,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:20:14,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2023-12-25 07:20:14,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2023-12-25 07:21:21,890 WARN L293 SmtUtils]: Spent 8.87s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 07:21:59,771 INFO L349 Elim1Store]: treesize reduction 6, result has 96.1 percent of original size [2023-12-25 07:21:59,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 216 [2023-12-25 07:22:38,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:22:38,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 146 [2023-12-25 07:22:41,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:22:41,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 188 treesize of output 238 [2023-12-25 07:22:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:22:48,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-25 07:23:03,991 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 07:23:04,001 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 07:23:04,836 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:23:04,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-25 07:23:05,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:23:05,037 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 37 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. [2023-12-25 07:23:05,041 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-12-25 07:23:05,043 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:23:05,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:23:05 BoogieIcfgContainer [2023-12-25 07:23:05,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:23:05,045 INFO L158 Benchmark]: Toolchain (without parser) took 885606.17ms. Allocated memory was 185.6MB in the beginning and 356.5MB in the end (delta: 170.9MB). Free memory was 133.1MB in the beginning and 177.6MB in the end (delta: -44.5MB). Peak memory consumption was 127.1MB. Max. memory is 8.0GB. [2023-12-25 07:23:05,045 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:23:05,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.74ms. Allocated memory is still 185.6MB. Free memory was 133.1MB in the beginning and 120.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 07:23:05,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.67ms. Allocated memory is still 185.6MB. Free memory was 120.8MB in the beginning and 119.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 07:23:05,047 INFO L158 Benchmark]: Boogie Preprocessor took 30.55ms. Allocated memory is still 185.6MB. Free memory was 119.1MB in the beginning and 116.7MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:23:05,047 INFO L158 Benchmark]: RCFGBuilder took 348.17ms. Allocated memory is still 185.6MB. Free memory was 116.7MB in the beginning and 97.5MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-25 07:23:05,047 INFO L158 Benchmark]: TraceAbstraction took 885009.16ms. Allocated memory was 185.6MB in the beginning and 356.5MB in the end (delta: 170.9MB). Free memory was 96.8MB in the beginning and 177.6MB in the end (delta: -80.9MB). Peak memory consumption was 90.4MB. Max. memory is 8.0GB. [2023-12-25 07:23:05,049 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.74ms. Allocated memory is still 185.6MB. Free memory was 133.1MB in the beginning and 120.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.67ms. Allocated memory is still 185.6MB. Free memory was 120.8MB in the beginning and 119.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.55ms. Allocated memory is still 185.6MB. Free memory was 119.1MB in the beginning and 116.7MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 348.17ms. Allocated memory is still 185.6MB. Free memory was 116.7MB in the beginning and 97.5MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 885009.16ms. Allocated memory was 185.6MB in the beginning and 356.5MB in the end (delta: 170.9MB). Free memory was 96.8MB in the beginning and 177.6MB in the end (delta: -80.9MB). Peak memory consumption was 90.4MB. 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 - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 38). Cancelled while NwaCegarLoop was analyzing trace of length 37 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 885.0s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 339.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 175.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 897 SdHoareTripleChecker+Invalid, 163.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 192 IncrementalHoareTripleChecker+Unchecked, 772 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1752 IncrementalHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 125 mSDtfsCounter, 1752 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 144 SyntacticMatches, 18 SemanticMatches, 153 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 310.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=6, InterpolantAutomatonStates: 98, 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, 6 MinimizatonAttempts, 21 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 147.6s SatisfiabilityAnalysisTime, 214.1s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 257 ConstructedInterpolants, 62 QuantifiedInterpolants, 10514 SizeOfPredicates, 114 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 99/172 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: Timeout Completed graceful shutdown