/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_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:33:32,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:33:32,210 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 06:33:32,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:33:32,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:33:32,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:33:32,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:33:32,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:33:32,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:33:32,240 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:33:32,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:33:32,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:33:32,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:33:32,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:33:32,242 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:33:32,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:33:32,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:33:32,243 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:33:32,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:33:32,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:33:32,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:33:32,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:33:32,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:33:32,244 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:33:32,244 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:33:32,245 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:33:32,245 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:33:32,245 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:33:32,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:33:32,245 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:33:32,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:33:32,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:33:32,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:33:32,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:33:32,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:33:32,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:33:32,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:33:32,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:33:32,247 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:33:32,247 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:33:32,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:33:32,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:33:32,248 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:33:32,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:33:32,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:33:32,248 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:33:32,248 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 06:33:32,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:33:32,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:33:32,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:33:32,453 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:33:32,454 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:33:32,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2023-12-25 06:33:33,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:33:33,713 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:33:33,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2023-12-25 06:33:33,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456f3d845/a8bdfda8446c4e7fa4abb9322778d619/FLAG40aecf2fd [2023-12-25 06:33:33,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456f3d845/a8bdfda8446c4e7fa4abb9322778d619 [2023-12-25 06:33:33,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:33:33,730 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:33:33,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:33:33,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:33:33,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:33:33,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:33,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eed8fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33, skipping insertion in model container [2023-12-25 06:33:33,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:33,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:33:33,885 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_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[2334,2347] [2023-12-25 06:33:33,893 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_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2023-12-25 06:33:33,897 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_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[5247,5260] [2023-12-25 06:33:33,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:33:33,914 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:33:33,925 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_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[2334,2347] [2023-12-25 06:33:33,934 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_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2023-12-25 06:33:33,936 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_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[5247,5260] [2023-12-25 06:33:33,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:33:33,948 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:33:33,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33 WrapperNode [2023-12-25 06:33:33,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:33:33,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:33:33,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:33:33,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:33:33,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:33,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:33,976 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2023-12-25 06:33:33,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:33:33,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:33:33,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:33:33,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:33:33,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:33,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:33,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:33,995 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 2 writes are split as follows [0, 1, 1]. [2023-12-25 06:33:33,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:33,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:34,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:34,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:34,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:34,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:34,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:33:34,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:33:34,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:33:34,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:33:34,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (1/1) ... [2023-12-25 06:33:34,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:33:34,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:33:34,041 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 06:33:34,052 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 06:33:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:33:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:33:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 06:33:34,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 06:33:34,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-25 06:33:34,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-25 06:33:34,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-25 06:33:34,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 06:33:34,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 06:33:34,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 06:33:34,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 06:33:34,071 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_22_0 [2023-12-25 06:33:34,071 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_22_0 [2023-12-25 06:33:34,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:33:34,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:33:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 06:33:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 06:33:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 06:33:34,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 06:33:34,134 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:33:34,136 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:33:34,361 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:33:34,388 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:33:34,395 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:33:34,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:33:34 BoogieIcfgContainer [2023-12-25 06:33:34,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:33:34,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:33:34,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:33:34,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:33:34,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:33:33" (1/3) ... [2023-12-25 06:33:34,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f139776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:33:34, skipping insertion in model container [2023-12-25 06:33:34,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:33:33" (2/3) ... [2023-12-25 06:33:34,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f139776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:33:34, skipping insertion in model container [2023-12-25 06:33:34,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:33:34" (3/3) ... [2023-12-25 06:33:34,401 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2023-12-25 06:33:34,413 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:33:34,413 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-12-25 06:33:34,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:33:34,456 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;@1f18c628, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:33:34,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-25 06:33:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 33 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:33:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 06:33:34,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:34,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:34,471 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:34,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1723010819, now seen corresponding path program 1 times [2023-12-25 06:33:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897155000] [2023-12-25 06:33:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:33:34,486 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 06:33:34,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:34,492 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 06:33:34,552 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 06:33:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:33:34,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 06:33:34,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:34,737 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 06:33:34,737 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:33:34,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:34,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897155000] [2023-12-25 06:33:34,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897155000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:33:34,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:33:34,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:33:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919196623] [2023-12-25 06:33:34,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:33:34,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 06:33:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:34,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 06:33:34,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:33:34,767 INFO L87 Difference]: Start difference. First operand has 36 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 33 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:33:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:34,838 INFO L93 Difference]: Finished difference Result 67 states and 96 transitions. [2023-12-25 06:33:34,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:33:34,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 06:33:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:34,845 INFO L225 Difference]: With dead ends: 67 [2023-12-25 06:33:34,845 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 06:33:34,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:33:34,850 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:34,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:33:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 06:33:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-25 06:33:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 06:33:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-12-25 06:33:34,874 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 14 [2023-12-25 06:33:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:34,874 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-12-25 06:33:34,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:33:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-12-25 06:33:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-25 06:33:34,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:34,876 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:34,886 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 (2)] Ended with exit code 0 [2023-12-25 06:33:35,078 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 06:33:35,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:35,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1314094639, now seen corresponding path program 1 times [2023-12-25 06:33:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:35,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106424485] [2023-12-25 06:33:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:33:35,080 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 06:33:35,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:35,081 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 06:33:35,085 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 06:33:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:33:35,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 06:33:35,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:33:35,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:33:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:33:35,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106424485] [2023-12-25 06:33:35,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106424485] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:33:35,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:33:35,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2023-12-25 06:33:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178770831] [2023-12-25 06:33:35,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:33:35,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 06:33:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 06:33:35,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-12-25 06:33:35,736 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 17 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:33:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:35,901 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2023-12-25 06:33:35,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:33:35,904 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2023-12-25 06:33:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:35,905 INFO L225 Difference]: With dead ends: 63 [2023-12-25 06:33:35,905 INFO L226 Difference]: Without dead ends: 37 [2023-12-25 06:33:35,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-12-25 06:33:35,906 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:35,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 343 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:33:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-25 06:33:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-25 06:33:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 06:33:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-12-25 06:33:35,912 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 19 [2023-12-25 06:33:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:35,912 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-12-25 06:33:35,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:33:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-12-25 06:33:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 06:33:35,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:35,913 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:35,918 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 06:33:36,114 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 06:33:36,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:36,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1158269963, now seen corresponding path program 2 times [2023-12-25 06:33:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:36,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010636786] [2023-12-25 06:33:36,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:33:36,115 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 06:33:36,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:36,119 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 06:33:36,124 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 06:33:36,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 06:33:36,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:33:36,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 06:33:36,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 06:33:36,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:33:36,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010636786] [2023-12-25 06:33:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010636786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:33:36,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:33:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 06:33:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207800509] [2023-12-25 06:33:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:33:36,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 06:33:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 06:33:36,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 06:33:36,204 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:33:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:36,212 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2023-12-25 06:33:36,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 06:33:36,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-12-25 06:33:36,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:36,213 INFO L225 Difference]: With dead ends: 44 [2023-12-25 06:33:36,213 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 06:33:36,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 06:33:36,214 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:36,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:33:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 06:33:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-12-25 06:33:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 06:33:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-12-25 06:33:36,220 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 24 [2023-12-25 06:33:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:36,220 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-12-25 06:33:36,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:33:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-12-25 06:33:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 06:33:36,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:36,221 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:36,226 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 06:33:36,423 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 06:33:36,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:36,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:36,424 INFO L85 PathProgramCache]: Analyzing trace with hash -634208600, now seen corresponding path program 1 times [2023-12-25 06:33:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785152357] [2023-12-25 06:33:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:33:36,426 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 06:33:36,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:36,429 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 06:33:36,430 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 06:33:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:33:36,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 06:33:36,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 06:33:36,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:33:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:33:37,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:37,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785152357] [2023-12-25 06:33:37,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785152357] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:33:37,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:33:37,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2023-12-25 06:33:37,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966165185] [2023-12-25 06:33:37,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:33:37,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 06:33:37,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:37,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 06:33:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-12-25 06:33:37,417 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 06:33:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:37,604 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2023-12-25 06:33:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:33:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 25 [2023-12-25 06:33:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:37,606 INFO L225 Difference]: With dead ends: 65 [2023-12-25 06:33:37,606 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 06:33:37,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2023-12-25 06:33:37,607 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:37,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 410 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:33:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 06:33:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-25 06:33:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:33:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2023-12-25 06:33:37,611 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2023-12-25 06:33:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:37,611 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-12-25 06:33:37,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 06:33:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2023-12-25 06:33:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 06:33:37,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:37,612 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:37,614 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 (5)] Forceful destruction successful, exit code 0 [2023-12-25 06:33:37,814 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 06:33:37,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:37,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash 669123610, now seen corresponding path program 2 times [2023-12-25 06:33:37,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:37,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926731040] [2023-12-25 06:33:37,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:33:37,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:33:37,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:37,816 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 06:33:37,820 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 06:33:37,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 06:33:37,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:33:37,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 06:33:37,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 06:33:37,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:33:37,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:37,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926731040] [2023-12-25 06:33:37,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926731040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:33:37,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:33:37,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 06:33:37,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85009126] [2023-12-25 06:33:37,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:33:37,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 06:33:37,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:37,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 06:33:37,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 06:33:37,899 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 06:33:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:37,918 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2023-12-25 06:33:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 06:33:37,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-12-25 06:33:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:37,919 INFO L225 Difference]: With dead ends: 66 [2023-12-25 06:33:37,919 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 06:33:37,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 06:33:37,920 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:37,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 51 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:33:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 06:33:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-12-25 06:33:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:33:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-12-25 06:33:37,928 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 30 [2023-12-25 06:33:37,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:37,928 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-12-25 06:33:37,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 06:33:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-12-25 06:33:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 06:33:37,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:37,929 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:37,933 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 (6)] Ended with exit code 0 [2023-12-25 06:33:38,133 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 06:33:38,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:38,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:38,134 INFO L85 PathProgramCache]: Analyzing trace with hash 600634101, now seen corresponding path program 1 times [2023-12-25 06:33:38,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:38,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163155346] [2023-12-25 06:33:38,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:33:38,135 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 06:33:38,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:38,136 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 06:33:38,139 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 06:33:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:33:38,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-25 06:33:38,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 06:33:38,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:33:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:33:39,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:39,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163155346] [2023-12-25 06:33:39,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163155346] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:33:39,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:33:39,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 26 [2023-12-25 06:33:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311541885] [2023-12-25 06:33:39,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:33:39,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 06:33:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 06:33:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2023-12-25 06:33:39,563 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 27 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 06:33:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:39,828 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2023-12-25 06:33:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:33:39,829 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 30 [2023-12-25 06:33:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:39,829 INFO L225 Difference]: With dead ends: 67 [2023-12-25 06:33:39,829 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 06:33:39,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2023-12-25 06:33:39,830 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:39,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 538 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:33:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 06:33:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-25 06:33:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 06:33:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-12-25 06:33:39,834 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2023-12-25 06:33:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:39,834 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-12-25 06:33:39,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 06:33:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-12-25 06:33:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 06:33:39,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:39,835 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:39,842 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 (7)] Forceful destruction successful, exit code 0 [2023-12-25 06:33:40,040 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 06:33:40,040 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:40,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash -446134917, now seen corresponding path program 2 times [2023-12-25 06:33:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:40,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374744367] [2023-12-25 06:33:40,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:33:40,041 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 06:33:40,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:40,042 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 06:33:40,043 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 06:33:40,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 06:33:40,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:33:40,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:33:40,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-25 06:33:40,125 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:33:40,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374744367] [2023-12-25 06:33:40,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374744367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:33:40,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:33:40,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 06:33:40,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824002449] [2023-12-25 06:33:40,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:33:40,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 06:33:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:40,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 06:33:40,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 06:33:40,126 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 06:33:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:40,146 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2023-12-25 06:33:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:33:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-12-25 06:33:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:40,148 INFO L225 Difference]: With dead ends: 61 [2023-12-25 06:33:40,148 INFO L226 Difference]: Without dead ends: 59 [2023-12-25 06:33:40,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:33:40,148 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:40,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 103 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:33:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-25 06:33:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2023-12-25 06:33:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 06:33:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2023-12-25 06:33:40,152 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 35 [2023-12-25 06:33:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:40,152 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-12-25 06:33:40,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 06:33:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2023-12-25 06:33:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 06:33:40,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:40,161 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:40,168 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 06:33:40,363 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 06:33:40,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:40,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -883318139, now seen corresponding path program 1 times [2023-12-25 06:33:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:40,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042843263] [2023-12-25 06:33:40,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:33:40,364 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 06:33:40,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:40,365 INFO L229 MonitoredProcess]: Starting monitored process 9 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 06:33:40,367 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 (9)] Waiting until timeout for monitored process [2023-12-25 06:33:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:33:40,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-25 06:33:40,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 06:33:40,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:33:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:33:42,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:42,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042843263] [2023-12-25 06:33:42,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042843263] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:33:42,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:33:42,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 31 [2023-12-25 06:33:42,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933961994] [2023-12-25 06:33:42,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:33:42,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 06:33:42,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:42,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 06:33:42,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2023-12-25 06:33:42,429 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 10 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-25 06:33:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:42,929 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-12-25 06:33:42,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:33:42,940 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 10 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 36 [2023-12-25 06:33:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:42,941 INFO L225 Difference]: With dead ends: 73 [2023-12-25 06:33:42,941 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 06:33:42,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 06:33:42,944 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:42,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 621 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:33:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 06:33:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-25 06:33:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 06:33:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-12-25 06:33:42,955 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 36 [2023-12-25 06:33:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:42,955 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-12-25 06:33:42,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 10 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-25 06:33:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-12-25 06:33:42,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 06:33:42,957 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:42,957 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:42,964 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 (9)] Ended with exit code 0 [2023-12-25 06:33:43,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 06:33:43,160 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:43,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1527717075, now seen corresponding path program 2 times [2023-12-25 06:33:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:43,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870612431] [2023-12-25 06:33:43,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:33:43,162 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 06:33:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:43,163 INFO L229 MonitoredProcess]: Starting monitored process 10 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 06:33:43,164 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 (10)] Waiting until timeout for monitored process [2023-12-25 06:33:43,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 06:33:43,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:33:43,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 06:33:43,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-25 06:33:43,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:33:43,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:43,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870612431] [2023-12-25 06:33:43,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870612431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:33:43,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:33:43,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 06:33:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862263517] [2023-12-25 06:33:43,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:33:43,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 06:33:43,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:43,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 06:33:43,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 06:33:43,270 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 06:33:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:43,304 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2023-12-25 06:33:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 06:33:43,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2023-12-25 06:33:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:43,307 INFO L225 Difference]: With dead ends: 66 [2023-12-25 06:33:43,307 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 06:33:43,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 06:33:43,309 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:43,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:33:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 06:33:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-12-25 06:33:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 06:33:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-12-25 06:33:43,321 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 41 [2023-12-25 06:33:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:43,322 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-12-25 06:33:43,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 06:33:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-12-25 06:33:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 06:33:43,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:43,325 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:43,339 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 06:33:43,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 06:33:43,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:43,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -534804051, now seen corresponding path program 1 times [2023-12-25 06:33:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:43,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888371789] [2023-12-25 06:33:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:33:43,528 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 06:33:43,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:43,531 INFO L229 MonitoredProcess]: Starting monitored process 11 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 06:33:43,537 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 (11)] Waiting until timeout for monitored process [2023-12-25 06:33:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:33:43,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-25 06:33:43,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-25 06:33:44,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:33:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:33:46,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:46,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888371789] [2023-12-25 06:33:46,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888371789] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:33:46,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:33:46,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25] total 36 [2023-12-25 06:33:46,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177318336] [2023-12-25 06:33:46,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:33:46,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-25 06:33:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:46,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-25 06:33:46,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 06:33:46,350 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 37 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 8 states have call successors, (8), 7 states have call predecessors, (8), 12 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2023-12-25 06:33:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:46,942 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2023-12-25 06:33:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:33:46,944 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 8 states have call successors, (8), 7 states have call predecessors, (8), 12 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) Word has length 46 [2023-12-25 06:33:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:46,945 INFO L225 Difference]: With dead ends: 65 [2023-12-25 06:33:46,945 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 06:33:46,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=253, Invalid=1553, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 06:33:46,946 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:46,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 657 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:33:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 06:33:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-25 06:33:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 06:33:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2023-12-25 06:33:46,949 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 46 [2023-12-25 06:33:46,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:46,949 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2023-12-25 06:33:46,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 8 states have call successors, (8), 7 states have call predecessors, (8), 12 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2023-12-25 06:33:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2023-12-25 06:33:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 06:33:46,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:46,949 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:46,952 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 (11)] Ended with exit code 0 [2023-12-25 06:33:47,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 06:33:47,153 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:47,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 63092019, now seen corresponding path program 2 times [2023-12-25 06:33:47,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974681370] [2023-12-25 06:33:47,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:33:47,153 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 06:33:47,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:47,154 INFO L229 MonitoredProcess]: Starting monitored process 12 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 06:33:47,156 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 (12)] Waiting until timeout for monitored process [2023-12-25 06:33:47,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 06:33:47,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:33:47,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 06:33:47,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:47,604 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 06:33:47,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 06:33:47,637 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 06:33:47,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 06:33:47,674 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 60 treesize of output 26 [2023-12-25 06:33:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-25 06:33:47,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:33:47,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:47,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974681370] [2023-12-25 06:33:47,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974681370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:33:47,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:33:47,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 06:33:47,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968003710] [2023-12-25 06:33:47,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:33:47,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 06:33:47,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:47,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 06:33:47,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:33:47,690 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:33:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:47,898 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2023-12-25 06:33:47,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:33:47,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2023-12-25 06:33:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:47,900 INFO L225 Difference]: With dead ends: 57 [2023-12-25 06:33:47,900 INFO L226 Difference]: Without dead ends: 38 [2023-12-25 06:33:47,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:33:47,900 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:47,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 59 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:33:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-25 06:33:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-12-25 06:33:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 06:33:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-12-25 06:33:47,903 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 51 [2023-12-25 06:33:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:47,903 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-12-25 06:33:47,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:33:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-12-25 06:33:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 06:33:47,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:47,904 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:47,906 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 (12)] Forceful destruction successful, exit code 0 [2023-12-25 06:33:48,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 06:33:48,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:48,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:48,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1274447164, now seen corresponding path program 1 times [2023-12-25 06:33:48,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:48,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099266420] [2023-12-25 06:33:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:33:48,108 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 06:33:48,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:48,109 INFO L229 MonitoredProcess]: Starting monitored process 13 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 06:33:48,140 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 (13)] Waiting until timeout for monitored process [2023-12-25 06:33:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:33:48,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-25 06:33:48,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-25 06:33:48,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:33:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:33:51,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099266420] [2023-12-25 06:33:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099266420] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:33:51,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:33:51,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 29] total 41 [2023-12-25 06:33:51,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864674861] [2023-12-25 06:33:51,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:33:51,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-25 06:33:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:51,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-25 06:33:51,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1535, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 06:33:51,827 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 42 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 9 states have call successors, (9), 8 states have call predecessors, (9), 14 states have return successors, (14), 13 states have call predecessors, (14), 9 states have call successors, (14) [2023-12-25 06:33:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:52,846 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2023-12-25 06:33:52,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:33:52,847 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 9 states have call successors, (9), 8 states have call predecessors, (9), 14 states have return successors, (14), 13 states have call predecessors, (14), 9 states have call successors, (14) Word has length 52 [2023-12-25 06:33:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:52,848 INFO L225 Difference]: With dead ends: 55 [2023-12-25 06:33:52,848 INFO L226 Difference]: Without dead ends: 38 [2023-12-25 06:33:52,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=307, Invalid=2045, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 06:33:52,849 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:52,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 682 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 06:33:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-25 06:33:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-25 06:33:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 06:33:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-12-25 06:33:52,851 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 52 [2023-12-25 06:33:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:52,851 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-12-25 06:33:52,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 9 states have call successors, (9), 8 states have call predecessors, (9), 14 states have return successors, (14), 13 states have call predecessors, (14), 9 states have call successors, (14) [2023-12-25 06:33:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-12-25 06:33:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 06:33:52,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:33:52,852 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:33:52,857 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 (13)] Forceful destruction successful, exit code 0 [2023-12-25 06:33:53,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 06:33:53,053 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:33:53,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:33:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1929240950, now seen corresponding path program 2 times [2023-12-25 06:33:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:33:53,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334500106] [2023-12-25 06:33:53,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:33:53,054 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 06:33:53,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:33:53,056 INFO L229 MonitoredProcess]: Starting monitored process 14 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 06:33:53,066 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 (14)] Waiting until timeout for monitored process [2023-12-25 06:33:53,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 06:33:53,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:33:53,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:33:53,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:33:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-12-25 06:33:53,142 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:33:53,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:33:53,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334500106] [2023-12-25 06:33:53,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334500106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:33:53,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:33:53,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 06:33:53,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990218178] [2023-12-25 06:33:53,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:33:53,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 06:33:53,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:33:53,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 06:33:53,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 06:33:53,144 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 06:33:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:33:53,155 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2023-12-25 06:33:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:33:53,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2023-12-25 06:33:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:33:53,155 INFO L225 Difference]: With dead ends: 44 [2023-12-25 06:33:53,155 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 06:33:53,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:33:53,156 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:33:53,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 67 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:33:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 06:33:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 06:33:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 06:33:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 06:33:53,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2023-12-25 06:33:53,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:33:53,156 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 06:33:53,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 06:33:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 06:33:53,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 06:33:53,158 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-25 06:33:53,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-25 06:33:53,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-25 06:33:53,161 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 (14)] Forceful destruction successful, exit code 0 [2023-12-25 06:33:53,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 06:33:53,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 06:33:53,382 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (= func_to_recursive_line_20_to_22_0_~i.offset |func_to_recursive_line_20_to_22_0_#in~i.offset|) (= func_to_recursive_line_20_to_22_0_~i.base |func_to_recursive_line_20_to_22_0_#in~i.base|) (= (store |old(#memory_int#2)| func_to_recursive_line_20_to_22_0_~i.base (let ((.cse0 (select |old(#memory_int#2)| func_to_recursive_line_20_to_22_0_~i.base))) (store .cse0 func_to_recursive_line_20_to_22_0_~i.offset (bvadd (_ bv1 32) (select .cse0 func_to_recursive_line_20_to_22_0_~i.offset))))) |#memory_int#2|)) [2023-12-25 06:33:53,382 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 36 51) the Hoare annotation is: (= |old(#memory_int#2)| |#memory_int#2|) [2023-12-25 06:33:53,382 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 50) no Hoare annotation was computed. [2023-12-25 06:33:53,382 INFO L899 garLoopResultBuilder]: For program point L38-1(lines 36 51) no Hoare annotation was computed. [2023-12-25 06:33:53,382 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_22_0EXIT(lines 36 51) no Hoare annotation was computed. [2023-12-25 06:33:53,382 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 232) no Hoare annotation was computed. [2023-12-25 06:33:53,382 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 133) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 202) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L114(lines 111 143) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L77(lines 74 212) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 196) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 53 233) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 222) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (and (= |ULTIMATE.start_main_~main__loop_entered~0#1| (_ bv0 32)) (= (select (select |#memory_int#2| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~#main__array~0#1.offset|)) [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 143) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##26(lines 160 190) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 212) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##24(lines 155 195) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 201) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L95(lines 93 202) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L186(lines 155 195) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L207(lines 72 217) no Hoare annotation was computed. [2023-12-25 06:33:53,383 INFO L899 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2023-12-25 06:33:53,384 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 06:33:53,384 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 227) no Hoare annotation was computed. [2023-12-25 06:33:53,384 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2023-12-25 06:33:53,384 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-12-25 06:33:53,384 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 170) no Hoare annotation was computed. [2023-12-25 06:33:53,384 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 148) no Hoare annotation was computed. [2023-12-25 06:33:53,384 INFO L899 garLoopResultBuilder]: For program point L138(lines 109 148) no Hoare annotation was computed. [2023-12-25 06:33:53,384 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 217) no Hoare annotation was computed. [2023-12-25 06:33:53,384 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 181) no Hoare annotation was computed. [2023-12-25 06:33:53,386 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1] [2023-12-25 06:33:53,387 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:33:53,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:33:53 BoogieIcfgContainer [2023-12-25 06:33:53,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:33:53,390 INFO L158 Benchmark]: Toolchain (without parser) took 19660.07ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 236.9MB in the beginning and 228.5MB in the end (delta: 8.4MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. [2023-12-25 06:33:53,390 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:33:53,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.56ms. Allocated memory is still 276.8MB. Free memory was 236.4MB in the beginning and 223.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 06:33:53,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.01ms. Allocated memory is still 276.8MB. Free memory was 223.3MB in the beginning and 221.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:33:53,391 INFO L158 Benchmark]: Boogie Preprocessor took 28.83ms. Allocated memory is still 276.8MB. Free memory was 221.7MB in the beginning and 219.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:33:53,391 INFO L158 Benchmark]: RCFGBuilder took 388.20ms. Allocated memory is still 276.8MB. Free memory was 219.1MB in the beginning and 201.3MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-25 06:33:53,391 INFO L158 Benchmark]: TraceAbstraction took 18993.03ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 200.8MB in the beginning and 228.5MB in the end (delta: -27.8MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. [2023-12-25 06:33:53,392 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.14ms. Allocated memory is still 179.3MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.56ms. Allocated memory is still 276.8MB. Free memory was 236.4MB in the beginning and 223.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.01ms. Allocated memory is still 276.8MB. Free memory was 223.3MB in the beginning and 221.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.83ms. Allocated memory is still 276.8MB. Free memory was 221.7MB in the beginning and 219.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 388.20ms. Allocated memory is still 276.8MB. Free memory was 219.1MB in the beginning and 201.3MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 18993.03ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 200.8MB in the beginning and 228.5MB in the end (delta: -27.8MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 125]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 170]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 13, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 3805 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3366 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1055 IncrementalHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 439 mSDtfsCounter, 1055 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 684 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1501 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=8, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 41 HoareAnnotationTreeSize, 5 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 460 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 4767 SizeOfPredicates, 84 NumberOfNonLiveVariables, 1290 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 514/906 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-25 06:33:53,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...