/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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 17:59:23,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 17:59:23,661 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-24 17:59:23,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 17:59:23,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 17:59:23,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 17:59:23,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 17:59:23,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 17:59:23,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 17:59:23,686 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 17:59:23,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 17:59:23,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 17:59:23,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 17:59:23,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 17:59:23,687 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 17:59:23,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 17:59:23,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 17:59:23,688 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 17:59:23,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 17:59:23,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 17:59:23,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 17:59:23,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 17:59:23,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 17:59:23,690 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 17:59:23,690 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 17:59:23,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 17:59:23,691 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 17:59:23,691 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 17:59:23,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 17:59:23,691 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 17:59:23,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 17:59:23,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 17:59:23,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 17:59:23,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 17:59:23,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 17:59:23,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 17:59:23,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 17:59:23,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 17:59:23,693 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 17:59:23,693 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 17:59:23,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 17:59:23,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 17:59:23,696 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 17:59:23,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 17:59:23,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 17:59:23,696 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 17:59:23,697 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-24 17:59:23,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 17:59:23,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 17:59:23,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 17:59:23,885 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 17:59:23,885 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 17:59:23,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-12-24 17:59:24,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 17:59:25,085 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 17:59:25,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-12-24 17:59:25,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081a812b2/b73d7b61422c480a826367da5dc72633/FLAG57df5ecc5 [2023-12-24 17:59:25,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081a812b2/b73d7b61422c480a826367da5dc72633 [2023-12-24 17:59:25,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 17:59:25,126 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 17:59:25,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 17:59:25,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 17:59:25,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 17:59:25,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6b53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25, skipping insertion in model container [2023-12-24 17:59:25,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,161 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 17:59:25,300 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2023-12-24 17:59:25,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 17:59:25,362 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 17:59:25,374 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2023-12-24 17:59:25,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 17:59:25,467 INFO L206 MainTranslator]: Completed translation [2023-12-24 17:59:25,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25 WrapperNode [2023-12-24 17:59:25,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 17:59:25,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 17:59:25,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 17:59:25,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 17:59:25,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,515 INFO L138 Inliner]: procedures = 36, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 536 [2023-12-24 17:59:25,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 17:59:25,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 17:59:25,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 17:59:25,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 17:59:25,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,559 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 18 writes are split as follows [0, 18]. [2023-12-24 17:59:25,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 17:59:25,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 17:59:25,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 17:59:25,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 17:59:25,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (1/1) ... [2023-12-24 17:59:25,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 17:59:25,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 17:59:25,629 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-24 17:59:25,642 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-24 17:59:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 17:59:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 17:59:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 17:59:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 17:59:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 17:59:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 17:59:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 17:59:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 17:59:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 17:59:25,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 17:59:25,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 17:59:25,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 17:59:25,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 17:59:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 17:59:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 17:59:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 17:59:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 17:59:25,743 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 17:59:25,745 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 17:59:26,385 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 17:59:26,411 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 17:59:26,411 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 17:59:26,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:59:26 BoogieIcfgContainer [2023-12-24 17:59:26,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 17:59:26,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 17:59:26,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 17:59:26,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 17:59:26,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 05:59:25" (1/3) ... [2023-12-24 17:59:26,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ad5025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:59:26, skipping insertion in model container [2023-12-24 17:59:26,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:59:25" (2/3) ... [2023-12-24 17:59:26,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ad5025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:59:26, skipping insertion in model container [2023-12-24 17:59:26,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:59:26" (3/3) ... [2023-12-24 17:59:26,419 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-36.i [2023-12-24 17:59:26,431 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 17:59:26,432 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 17:59:26,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 17:59:26,472 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;@40a7d719, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 17:59:26,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 17:59:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 17:59:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 17:59:26,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:59:26,484 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:59:26,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:59:26,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:59:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1440714402, now seen corresponding path program 1 times [2023-12-24 17:59:26,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:59:26,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523264171] [2023-12-24 17:59:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:59:26,498 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-24 17:59:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:59:26,505 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-24 17:59:26,506 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-24 17:59:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:59:26,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 17:59:26,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:59:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-24 17:59:26,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:59:26,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:59:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523264171] [2023-12-24 17:59:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523264171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:59:26,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:59:26,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 17:59:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995518571] [2023-12-24 17:59:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:59:26,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 17:59:26,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:59:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 17:59:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 17:59:26,845 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-24 17:59:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:59:26,913 INFO L93 Difference]: Finished difference Result 217 states and 345 transitions. [2023-12-24 17:59:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 17:59:26,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2023-12-24 17:59:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:59:26,922 INFO L225 Difference]: With dead ends: 217 [2023-12-24 17:59:26,923 INFO L226 Difference]: Without dead ends: 106 [2023-12-24 17:59:26,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 17:59:26,932 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:59:26,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:59:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-24 17:59:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-12-24 17:59:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 17:59:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2023-12-24 17:59:26,974 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 103 [2023-12-24 17:59:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:59:26,974 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2023-12-24 17:59:26,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-24 17:59:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2023-12-24 17:59:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 17:59:26,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:59:26,977 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:59:26,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 17:59:27,196 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-24 17:59:27,197 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:59:27,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:59:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash -411674344, now seen corresponding path program 1 times [2023-12-24 17:59:27,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:59:27,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775284203] [2023-12-24 17:59:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:59:27,199 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-24 17:59:27,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:59:27,201 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-24 17:59:27,233 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-24 17:59:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:59:27,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 17:59:27,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:59:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-24 17:59:27,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:59:27,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:59:27,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775284203] [2023-12-24 17:59:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775284203] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:59:27,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:59:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 17:59:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425658053] [2023-12-24 17:59:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:59:27,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 17:59:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:59:27,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 17:59:27,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 17:59:27,510 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-24 17:59:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:59:27,614 INFO L93 Difference]: Finished difference Result 217 states and 324 transitions. [2023-12-24 17:59:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 17:59:27,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2023-12-24 17:59:27,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:59:27,615 INFO L225 Difference]: With dead ends: 217 [2023-12-24 17:59:27,615 INFO L226 Difference]: Without dead ends: 112 [2023-12-24 17:59:27,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 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-24 17:59:27,617 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 10 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:59:27,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 454 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:59:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-24 17:59:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2023-12-24 17:59:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 17:59:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2023-12-24 17:59:27,628 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 103 [2023-12-24 17:59:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:59:27,629 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2023-12-24 17:59:27,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-24 17:59:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2023-12-24 17:59:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 17:59:27,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:59:27,630 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:59:27,644 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 (3)] Ended with exit code 0 [2023-12-24 17:59:27,837 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-24 17:59:27,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:59:27,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:59:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash -972374122, now seen corresponding path program 1 times [2023-12-24 17:59:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:59:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603858904] [2023-12-24 17:59:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:59:27,838 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-24 17:59:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:59:27,842 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-24 17:59:27,843 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-24 17:59:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:59:28,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 17:59:28,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:59:28,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:59:28,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 64 [2023-12-24 17:59:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 17:59:28,167 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:59:28,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:59:28,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603858904] [2023-12-24 17:59:28,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603858904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:59:28,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:59:28,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 17:59:28,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177540329] [2023-12-24 17:59:28,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:59:28,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 17:59:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:59:28,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 17:59:28,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 17:59:28,170 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 17:59:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:59:28,212 INFO L93 Difference]: Finished difference Result 211 states and 312 transitions. [2023-12-24 17:59:28,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 17:59:28,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2023-12-24 17:59:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:59:28,216 INFO L225 Difference]: With dead ends: 211 [2023-12-24 17:59:28,216 INFO L226 Difference]: Without dead ends: 104 [2023-12-24 17:59:28,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-24 17:59:28,220 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:59:28,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:59:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-24 17:59:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-24 17:59:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 17:59:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2023-12-24 17:59:28,231 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 103 [2023-12-24 17:59:28,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:59:28,231 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2023-12-24 17:59:28,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 17:59:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2023-12-24 17:59:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 17:59:28,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:59:28,233 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:59:28,240 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 (4)] Forceful destruction successful, exit code 0 [2023-12-24 17:59:28,433 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-24 17:59:28,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:59:28,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:59:28,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1983491372, now seen corresponding path program 1 times [2023-12-24 17:59:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:59:28,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330755399] [2023-12-24 17:59:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:59:28,437 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-24 17:59:28,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:59:28,454 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-24 17:59:28,457 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-24 17:59:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:59:28,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 17:59:28,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:59:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 17:59:28,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:59:28,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:59:28,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330755399] [2023-12-24 17:59:28,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330755399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:59:28,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:59:28,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 17:59:28,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836793672] [2023-12-24 17:59:28,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:59:28,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 17:59:28,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:59:28,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 17:59:28,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 17:59:28,714 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 17:59:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:59:28,734 INFO L93 Difference]: Finished difference Result 201 states and 292 transitions. [2023-12-24 17:59:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 17:59:28,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2023-12-24 17:59:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:59:28,735 INFO L225 Difference]: With dead ends: 201 [2023-12-24 17:59:28,735 INFO L226 Difference]: Without dead ends: 98 [2023-12-24 17:59:28,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-24 17:59:28,736 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 32 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:59:28,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 233 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:59:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-24 17:59:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-24 17:59:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 17:59:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2023-12-24 17:59:28,741 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 103 [2023-12-24 17:59:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:59:28,742 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2023-12-24 17:59:28,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 17:59:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2023-12-24 17:59:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-24 17:59:28,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:59:28,743 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:59:28,753 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-24 17:59:28,951 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-24 17:59:28,951 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:59:28,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:59:28,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1282426794, now seen corresponding path program 1 times [2023-12-24 17:59:28,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:59:28,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330172190] [2023-12-24 17:59:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:59:28,952 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-24 17:59:28,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:59:28,953 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-24 17:59:28,954 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-24 17:59:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:59:29,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 17:59:29,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:59:29,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 17:59:29,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2023-12-24 17:59:32,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:59:32,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49 [2023-12-24 17:59:32,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:59:32,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 39 [2023-12-24 17:59:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 17:59:32,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:59:32,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:59:32,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330172190] [2023-12-24 17:59:32,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330172190] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:59:32,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:59:32,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 17:59:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63014788] [2023-12-24 17:59:32,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:59:32,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 17:59:32,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:59:32,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 17:59:32,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=27, Unknown=1, NotChecked=0, Total=42 [2023-12-24 17:59:32,323 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 17:59:35,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 17:59:39,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 17:59:42,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 17:59:46,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 17:59:50,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 17:59:52,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 17:59:56,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:00:00,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:00:04,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:00:08,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:00:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:00:11,416 INFO L93 Difference]: Finished difference Result 302 states and 432 transitions. [2023-12-24 18:00:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 18:00:11,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2023-12-24 18:00:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:00:11,419 INFO L225 Difference]: With dead ends: 302 [2023-12-24 18:00:11,419 INFO L226 Difference]: Without dead ends: 205 [2023-12-24 18:00:11,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=28, Invalid=43, Unknown=1, NotChecked=0, Total=72 [2023-12-24 18:00:11,421 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 256 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 44 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.9s IncrementalHoareTripleChecker+Time [2023-12-24 18:00:11,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 633 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 368 Invalid, 10 Unknown, 0 Unchecked, 38.9s Time] [2023-12-24 18:00:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-12-24 18:00:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 113. [2023-12-24 18:00:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.37) internal successors, (137), 100 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 18:00:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2023-12-24 18:00:11,453 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 103 [2023-12-24 18:00:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:00:11,454 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2023-12-24 18:00:11,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2023-12-24 18:00:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-24 18:00:11,457 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:00:11,457 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:00:11,472 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-24 18:00:11,672 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-24 18:00:11,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:00:11,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:00:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2080848100, now seen corresponding path program 1 times [2023-12-24 18:00:11,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:00:11,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628270238] [2023-12-24 18:00:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:00:11,675 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-24 18:00:11,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:00:11,676 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-24 18:00:11,721 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-24 18:00:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:00:11,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 18:00:11,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:00:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 18:00:11,948 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 18:00:11,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:00:11,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628270238] [2023-12-24 18:00:11,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628270238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 18:00:11,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 18:00:11,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 18:00:11,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982672787] [2023-12-24 18:00:11,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 18:00:11,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 18:00:11,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:00:11,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 18:00:11,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 18:00:11,951 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:00:12,033 INFO L93 Difference]: Finished difference Result 242 states and 343 transitions. [2023-12-24 18:00:12,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 18:00:12,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2023-12-24 18:00:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:00:12,035 INFO L225 Difference]: With dead ends: 242 [2023-12-24 18:00:12,035 INFO L226 Difference]: Without dead ends: 130 [2023-12-24 18:00:12,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 18:00:12,039 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 18:00:12,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 527 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 18:00:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-24 18:00:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2023-12-24 18:00:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 18:00:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2023-12-24 18:00:12,055 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 105 [2023-12-24 18:00:12,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:00:12,055 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2023-12-24 18:00:12,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2023-12-24 18:00:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-24 18:00:12,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:00:12,056 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:00:12,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-24 18:00:12,268 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-24 18:00:12,269 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:00:12,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:00:12,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1223096766, now seen corresponding path program 1 times [2023-12-24 18:00:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:00:12,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525908699] [2023-12-24 18:00:12,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:00:12,270 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-24 18:00:12,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:00:12,271 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-24 18:00:12,306 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-24 18:00:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:00:12,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 18:00:12,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:00:12,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 18:00:12,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2023-12-24 18:00:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 18:00:12,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 18:00:12,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:00:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525908699] [2023-12-24 18:00:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525908699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 18:00:12,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 18:00:12,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 18:00:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452693155] [2023-12-24 18:00:12,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 18:00:12,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 18:00:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:00:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 18:00:12,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 18:00:12,731 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:00:13,905 INFO L93 Difference]: Finished difference Result 227 states and 318 transitions. [2023-12-24 18:00:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 18:00:13,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2023-12-24 18:00:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:00:13,922 INFO L225 Difference]: With dead ends: 227 [2023-12-24 18:00:13,922 INFO L226 Difference]: Without dead ends: 113 [2023-12-24 18:00:13,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 18:00:13,923 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 138 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 18:00:13,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 234 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 18:00:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-24 18:00:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2023-12-24 18:00:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 18:00:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 138 transitions. [2023-12-24 18:00:13,930 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 138 transitions. Word has length 105 [2023-12-24 18:00:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:00:13,931 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 138 transitions. [2023-12-24 18:00:13,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2023-12-24 18:00:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-24 18:00:13,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:00:13,933 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:00:13,954 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 (8)] Forceful destruction successful, exit code 0 [2023-12-24 18:00:14,133 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-24 18:00:14,134 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:00:14,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:00:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash -738826679, now seen corresponding path program 1 times [2023-12-24 18:00:14,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:00:14,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950663306] [2023-12-24 18:00:14,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:00:14,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-24 18:00:14,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:00:14,137 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-24 18:00:14,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 (9)] Waiting until timeout for monitored process [2023-12-24 18:00:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:00:14,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 18:00:14,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:00:14,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 18:00:14,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2023-12-24 18:00:14,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:14,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2023-12-24 18:00:15,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:15,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 53 [2023-12-24 18:00:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 18:00:15,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 18:00:15,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:00:15,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950663306] [2023-12-24 18:00:15,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950663306] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 18:00:15,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 18:00:15,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 18:00:15,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796458851] [2023-12-24 18:00:15,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 18:00:15,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 18:00:15,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:00:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 18:00:15,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-24 18:00:15,342 INFO L87 Difference]: Start difference. First operand 98 states and 138 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:17,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:00:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:00:19,052 INFO L93 Difference]: Finished difference Result 301 states and 425 transitions. [2023-12-24 18:00:19,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 18:00:19,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2023-12-24 18:00:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:00:19,055 INFO L225 Difference]: With dead ends: 301 [2023-12-24 18:00:19,055 INFO L226 Difference]: Without dead ends: 204 [2023-12-24 18:00:19,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-12-24 18:00:19,056 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 263 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-24 18:00:19,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 619 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-24 18:00:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-24 18:00:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 114. [2023-12-24 18:00:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 18:00:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2023-12-24 18:00:19,070 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 107 [2023-12-24 18:00:19,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:00:19,070 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2023-12-24 18:00:19,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2023-12-24 18:00:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-24 18:00:19,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:00:19,072 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:00:19,087 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 (9)] Forceful destruction successful, exit code 0 [2023-12-24 18:00:19,283 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-24 18:00:19,284 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:00:19,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:00:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2019995651, now seen corresponding path program 1 times [2023-12-24 18:00:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:00:19,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721047989] [2023-12-24 18:00:19,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:00:19,285 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-24 18:00:19,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:00:19,286 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-24 18:00:19,288 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-24 18:00:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:00:19,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 18:00:19,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:00:19,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 18:00:19,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 14 [2023-12-24 18:00:19,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-24 18:00:19,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-12-24 18:00:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 18:00:19,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 18:00:19,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:00:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721047989] [2023-12-24 18:00:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721047989] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 18:00:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 18:00:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 18:00:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297370673] [2023-12-24 18:00:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 18:00:19,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 18:00:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:00:19,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 18:00:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 18:00:19,956 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:00:21,919 INFO L93 Difference]: Finished difference Result 233 states and 315 transitions. [2023-12-24 18:00:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 18:00:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2023-12-24 18:00:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:00:21,921 INFO L225 Difference]: With dead ends: 233 [2023-12-24 18:00:21,921 INFO L226 Difference]: Without dead ends: 231 [2023-12-24 18:00:21,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-24 18:00:21,922 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 125 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-24 18:00:21,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 677 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-24 18:00:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-12-24 18:00:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 162. [2023-12-24 18:00:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 149 states have internal predecessors, (192), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 18:00:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 214 transitions. [2023-12-24 18:00:21,936 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 214 transitions. Word has length 109 [2023-12-24 18:00:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:00:21,937 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 214 transitions. [2023-12-24 18:00:21,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 214 transitions. [2023-12-24 18:00:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-24 18:00:21,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:00:21,938 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:00:21,960 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-24 18:00:22,150 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-24 18:00:22,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:00:22,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:00:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1694579323, now seen corresponding path program 1 times [2023-12-24 18:00:22,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:00:22,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601146744] [2023-12-24 18:00:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:00:22,152 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-24 18:00:22,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:00:22,153 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-24 18:00:22,159 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-24 18:00:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:00:22,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 18:00:22,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:00:22,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 18:00:23,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2023-12-24 18:00:23,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2023-12-24 18:00:23,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:23,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 77 [2023-12-24 18:00:24,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:24,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 100 [2023-12-24 18:00:28,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:28,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 176 treesize of output 116 [2023-12-24 18:00:35,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:35,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 181 treesize of output 139 [2023-12-24 18:00:47,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:47,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 195 treesize of output 155 [2023-12-24 18:00:49,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:49,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 210 treesize of output 158 [2023-12-24 18:00:49,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:49,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 272 treesize of output 173 [2023-12-24 18:00:50,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:50,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 197 treesize of output 149 [2023-12-24 18:00:51,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:51,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 236 treesize of output 86 [2023-12-24 18:00:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 96 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-24 18:00:51,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 18:00:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 18:00:52,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:00:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601146744] [2023-12-24 18:00:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601146744] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 18:00:52,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 18:00:52,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2023-12-24 18:00:52,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540993315] [2023-12-24 18:00:52,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 18:00:52,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 18:00:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:00:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 18:00:52,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=377, Unknown=6, NotChecked=0, Total=462 [2023-12-24 18:00:52,116 INFO L87 Difference]: Start difference. First operand 162 states and 214 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:00:53,215 INFO L93 Difference]: Finished difference Result 353 states and 467 transitions. [2023-12-24 18:00:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 18:00:53,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2023-12-24 18:00:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:00:53,220 INFO L225 Difference]: With dead ends: 353 [2023-12-24 18:00:53,220 INFO L226 Difference]: Without dead ends: 192 [2023-12-24 18:00:53,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=84, Invalid=416, Unknown=6, NotChecked=0, Total=506 [2023-12-24 18:00:53,221 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 60 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 18:00:53,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 317 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 18:00:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-12-24 18:00:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2023-12-24 18:00:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 18:00:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2023-12-24 18:00:53,260 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 110 [2023-12-24 18:00:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:00:53,260 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2023-12-24 18:00:53,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:00:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2023-12-24 18:00:53,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-24 18:00:53,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:00:53,261 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:00:53,277 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 (11)] Forceful destruction successful, exit code 0 [2023-12-24 18:00:53,474 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-24 18:00:53,475 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:00:53,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:00:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1311076992, now seen corresponding path program 1 times [2023-12-24 18:00:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:00:53,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204721003] [2023-12-24 18:00:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:00:53,476 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-24 18:00:53,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:00:53,478 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-24 18:00:53,480 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-24 18:00:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:00:53,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-24 18:00:53,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:00:54,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 18:00:54,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2023-12-24 18:00:54,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 54 [2023-12-24 18:00:58,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:00:58,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 70 [2023-12-24 18:01:06,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:01:06,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 83 [2023-12-24 18:01:19,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:01:19,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 96 [2023-12-24 18:01:19,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:01:19,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 99 [2023-12-24 18:01:20,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:01:20,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 193 treesize of output 124 [2023-12-24 18:01:20,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:01:20,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 178 treesize of output 124 [2023-12-24 18:01:21,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:01:21,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 79 [2023-12-24 18:01:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 96 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-24 18:01:21,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 18:01:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 18:01:22,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:01:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204721003] [2023-12-24 18:01:22,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204721003] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 18:01:22,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 18:01:22,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2023-12-24 18:01:22,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738921409] [2023-12-24 18:01:22,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 18:01:22,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 18:01:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:01:22,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 18:01:22,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=209, Unknown=6, NotChecked=0, Total=272 [2023-12-24 18:01:22,345 INFO L87 Difference]: Start difference. First operand 162 states and 212 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:01:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:01:23,185 INFO L93 Difference]: Finished difference Result 338 states and 442 transitions. [2023-12-24 18:01:23,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 18:01:23,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2023-12-24 18:01:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:01:23,187 INFO L225 Difference]: With dead ends: 338 [2023-12-24 18:01:23,187 INFO L226 Difference]: Without dead ends: 177 [2023-12-24 18:01:23,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=62, Invalid=238, Unknown=6, NotChecked=0, Total=306 [2023-12-24 18:01:23,188 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 53 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 18:01:23,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 389 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 18:01:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-24 18:01:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 162. [2023-12-24 18:01:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 149 states have (on average 1.261744966442953) internal successors, (188), 149 states have internal predecessors, (188), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 18:01:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 210 transitions. [2023-12-24 18:01:23,194 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 210 transitions. Word has length 110 [2023-12-24 18:01:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:01:23,194 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 210 transitions. [2023-12-24 18:01:23,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:01:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 210 transitions. [2023-12-24 18:01:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-24 18:01:23,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:01:23,195 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:01:23,207 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-24 18:01:23,402 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-24 18:01:23,402 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:01:23,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:01:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1917051749, now seen corresponding path program 1 times [2023-12-24 18:01:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:01:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344664344] [2023-12-24 18:01:23,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:01:23,403 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-24 18:01:23,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:01:23,405 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-24 18:01:23,438 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-24 18:01:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:01:23,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 18:01:23,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:01:23,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2023-12-24 18:01:24,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 83 [2023-12-24 18:01:25,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:01:25,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 145 [2023-12-24 18:01:26,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:01:26,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 307 treesize of output 139 [2023-12-24 18:01:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-24 18:01:26,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 18:01:29,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:01:29,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344664344] [2023-12-24 18:01:29,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344664344] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 18:01:29,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2060417963] [2023-12-24 18:01:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:01:29,458 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 18:01:29,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 18:01:29,521 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 18:01:29,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-24 18:01:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:01:32,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 18:01:32,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:01:34,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-24 18:01:36,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 63 [2023-12-24 18:01:54,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:01:54,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 85 [2023-12-24 18:02:04,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:02:04,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 191 treesize of output 83 [2023-12-24 18:02:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-24 18:02:12,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 18:02:21,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2060417963] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 18:02:21,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 18:02:21,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-24 18:02:21,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118280620] [2023-12-24 18:02:21,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 18:02:21,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 18:02:21,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:02:21,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 18:02:21,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=778, Unknown=10, NotChecked=0, Total=930 [2023-12-24 18:02:21,787 INFO L87 Difference]: Start difference. First operand 162 states and 210 transitions. Second operand has 24 states, 24 states have (on average 4.625) internal successors, (111), 23 states have internal predecessors, (111), 8 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-12-24 18:02:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:02:48,083 INFO L93 Difference]: Finished difference Result 597 states and 773 transitions. [2023-12-24 18:02:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 18:02:48,084 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.625) internal successors, (111), 23 states have internal predecessors, (111), 8 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 111 [2023-12-24 18:02:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:02:48,086 INFO L225 Difference]: With dead ends: 597 [2023-12-24 18:02:48,086 INFO L226 Difference]: Without dead ends: 436 [2023-12-24 18:02:48,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=281, Invalid=1268, Unknown=11, NotChecked=0, Total=1560 [2023-12-24 18:02:48,087 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1169 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2023-12-24 18:02:48,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1275 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 18.4s Time] [2023-12-24 18:02:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-12-24 18:02:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 422. [2023-12-24 18:02:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 385 states have (on average 1.2545454545454546) internal successors, (483), 387 states have internal predecessors, (483), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 18:02:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 547 transitions. [2023-12-24 18:02:48,106 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 547 transitions. Word has length 111 [2023-12-24 18:02:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:02:48,107 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 547 transitions. [2023-12-24 18:02:48,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.625) internal successors, (111), 23 states have internal predecessors, (111), 8 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-12-24 18:02:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 547 transitions. [2023-12-24 18:02:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-24 18:02:48,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:02:48,108 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:02:48,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-12-24 18:02:48,327 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-24 18:02:48,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-24 18:02:48,527 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:02:48,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:02:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1901533031, now seen corresponding path program 1 times [2023-12-24 18:02:48,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:02:48,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971929513] [2023-12-24 18:02:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:02:48,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-24 18:02:48,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:02:48,533 INFO L229 MonitoredProcess]: Starting monitored process 15 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-24 18:02:48,534 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 (15)] Waiting until timeout for monitored process [2023-12-24 18:02:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:02:48,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 18:02:48,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:02:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-24 18:02:48,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 18:02:48,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:02:48,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971929513] [2023-12-24 18:02:48,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971929513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 18:02:48,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 18:02:48,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 18:02:48,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509255331] [2023-12-24 18:02:48,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 18:02:48,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 18:02:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:02:48,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 18:02:48,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 18:02:48,819 INFO L87 Difference]: Start difference. First operand 422 states and 547 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-24 18:02:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:02:48,962 INFO L93 Difference]: Finished difference Result 853 states and 1108 transitions. [2023-12-24 18:02:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 18:02:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2023-12-24 18:02:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:02:48,965 INFO L225 Difference]: With dead ends: 853 [2023-12-24 18:02:48,965 INFO L226 Difference]: Without dead ends: 432 [2023-12-24 18:02:48,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 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-24 18:02:48,966 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 7 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 18:02:48,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 393 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 18:02:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-12-24 18:02:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 424. [2023-12-24 18:02:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 387 states have (on average 1.2506459948320414) internal successors, (484), 389 states have internal predecessors, (484), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 18:02:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 548 transitions. [2023-12-24 18:02:48,986 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 548 transitions. Word has length 111 [2023-12-24 18:02:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:02:48,986 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 548 transitions. [2023-12-24 18:02:48,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-24 18:02:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 548 transitions. [2023-12-24 18:02:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-24 18:02:48,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:02:48,988 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:02:49,002 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 (15)] Forceful destruction successful, exit code 0 [2023-12-24 18:02:49,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-24 18:02:49,196 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:02:49,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:02:49,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1944186461, now seen corresponding path program 1 times [2023-12-24 18:02:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:02:49,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366234410] [2023-12-24 18:02:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:02:49,197 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-24 18:02:49,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:02:49,198 INFO L229 MonitoredProcess]: Starting monitored process 16 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-24 18:02:49,233 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 (16)] Waiting until timeout for monitored process [2023-12-24 18:02:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:02:49,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 18:02:49,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:02:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-12-24 18:02:49,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 18:02:49,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:02:49,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366234410] [2023-12-24 18:02:49,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366234410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 18:02:49,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 18:02:49,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 18:02:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954464626] [2023-12-24 18:02:49,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 18:02:49,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 18:02:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:02:49,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 18:02:49,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 18:02:49,440 INFO L87 Difference]: Start difference. First operand 424 states and 548 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-24 18:02:49,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:02:49,576 INFO L93 Difference]: Finished difference Result 851 states and 1101 transitions. [2023-12-24 18:02:49,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 18:02:49,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2023-12-24 18:02:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:02:49,604 INFO L225 Difference]: With dead ends: 851 [2023-12-24 18:02:49,604 INFO L226 Difference]: Without dead ends: 428 [2023-12-24 18:02:49,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 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-24 18:02:49,605 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 7 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 18:02:49,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 393 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 18:02:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-12-24 18:02:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 424. [2023-12-24 18:02:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 387 states have (on average 1.248062015503876) internal successors, (483), 389 states have internal predecessors, (483), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 18:02:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 547 transitions. [2023-12-24 18:02:49,626 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 547 transitions. Word has length 111 [2023-12-24 18:02:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:02:49,627 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 547 transitions. [2023-12-24 18:02:49,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-24 18:02:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 547 transitions. [2023-12-24 18:02:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-24 18:02:49,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:02:49,628 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:02:49,635 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 (16)] Ended with exit code 0 [2023-12-24 18:02:49,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-24 18:02:49,835 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:02:49,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:02:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1835012557, now seen corresponding path program 1 times [2023-12-24 18:02:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:02:49,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136032920] [2023-12-24 18:02:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:02:49,836 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-24 18:02:49,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:02:49,837 INFO L229 MonitoredProcess]: Starting monitored process 17 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-24 18:02:49,853 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 (17)] Waiting until timeout for monitored process [2023-12-24 18:02:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:02:50,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 18:02:50,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:02:50,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2023-12-24 18:02:51,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:02:51,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 77 [2023-12-24 18:02:56,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:02:56,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 125 [2023-12-24 18:02:57,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:02:57,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 85 [2023-12-24 18:02:57,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:02:57,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 105 [2023-12-24 18:03:02,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:03:02,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 117 treesize of output 111 [2023-12-24 18:03:03,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:03:03,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 204 treesize of output 78 [2023-12-24 18:03:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-24 18:03:03,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 18:03:08,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:03:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136032920] [2023-12-24 18:03:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136032920] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 18:03:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1102811974] [2023-12-24 18:03:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:03:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 18:03:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 18:03:08,479 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 18:03:08,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-12-24 18:03:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:03:10,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-24 18:03:10,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:03:11,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-24 18:03:18,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 79 [2023-12-24 18:03:21,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:03:21,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 131 [2023-12-24 18:03:23,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:03:23,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 131 [2023-12-24 18:03:24,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:03:24,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 139 [2023-12-24 18:03:28,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:03:28,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 96 [2023-12-24 18:03:34,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:03:34,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 207 treesize of output 91 [2023-12-24 18:03:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 28 proven. 96 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-12-24 18:03:39,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 18:03:50,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1102811974] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 18:03:50,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 18:03:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2023-12-24 18:03:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510300416] [2023-12-24 18:03:50,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 18:03:50,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-24 18:03:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:03:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-24 18:03:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=874, Unknown=8, NotChecked=0, Total=1056 [2023-12-24 18:03:50,339 INFO L87 Difference]: Start difference. First operand 424 states and 547 transitions. Second operand has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 7 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2023-12-24 18:03:58,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:04:07,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:04:11,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:04:15,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:04:19,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:04:23,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:04:30,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:04:39,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:04:47,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:04:51,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:04,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:08,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:12,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:16,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:29,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:33,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:37,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:41,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:45,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:49,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:53,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:05:57,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:01,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:05,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:09,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:13,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:17,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:21,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:26,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:30,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:34,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:38,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:42,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:46,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:50,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:54,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:06:58,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:02,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:06,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:10,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:19,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:23,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:28,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:32,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:36,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:40,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:44,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:48,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:52,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:07:56,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:08:01,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:08:05,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:08:09,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:08:13,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:08:17,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:08:21,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 18:08:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:08:32,674 INFO L93 Difference]: Finished difference Result 865 states and 1109 transitions. [2023-12-24 18:08:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 18:08:32,676 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 7 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 112 [2023-12-24 18:08:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:08:32,677 INFO L225 Difference]: With dead ends: 865 [2023-12-24 18:08:32,677 INFO L226 Difference]: Without dead ends: 442 [2023-12-24 18:08:32,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 290 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 85.2s TimeCoverageRelationStatistics Valid=354, Invalid=1436, Unknown=16, NotChecked=0, Total=1806 [2023-12-24 18:08:32,679 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 904 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 284 mSolverCounterUnsat, 56 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 243.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 56 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 244.1s IncrementalHoareTripleChecker+Time [2023-12-24 18:08:32,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 930 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1351 Invalid, 56 Unknown, 0 Unchecked, 244.1s Time] [2023-12-24 18:08:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-12-24 18:08:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 428. [2023-12-24 18:08:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 389 states have (on average 1.2390745501285347) internal successors, (482), 391 states have internal predecessors, (482), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 18:08:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 546 transitions. [2023-12-24 18:08:32,704 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 546 transitions. Word has length 112 [2023-12-24 18:08:32,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:08:32,704 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 546 transitions. [2023-12-24 18:08:32,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 7 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2023-12-24 18:08:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 546 transitions. [2023-12-24 18:08:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-24 18:08:32,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:08:32,705 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:08:32,715 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 (17)] Forceful destruction successful, exit code 0 [2023-12-24 18:08:32,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-12-24 18:08:33,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 18:08:33,115 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:08:33,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:08:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash 234860260, now seen corresponding path program 1 times [2023-12-24 18:08:33,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:08:33,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171405286] [2023-12-24 18:08:33,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:08:33,118 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-24 18:08:33,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:08:33,141 INFO L229 MonitoredProcess]: Starting monitored process 19 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-24 18:08:33,195 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 (19)] Waiting until timeout for monitored process [2023-12-24 18:08:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:08:33,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 18:08:33,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:08:34,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 18:08:34,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:08:34,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 69 [2023-12-24 18:08:39,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:08:39,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 72 [2023-12-24 18:08:39,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:08:39,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 82 [2023-12-24 18:08:39,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:08:39,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 85 [2023-12-24 18:08:40,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:08:40,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 261 treesize of output 141 [2023-12-24 18:08:40,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:08:40,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 276 treesize of output 147 [2023-12-24 18:08:42,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:08:42,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 414 treesize of output 138 [2023-12-24 18:08:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 32 proven. 120 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-24 18:08:43,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 18:08:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 18:08:45,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:08:45,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171405286] [2023-12-24 18:08:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171405286] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 18:08:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 18:08:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 22 [2023-12-24 18:08:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776893442] [2023-12-24 18:08:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 18:08:45,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 18:08:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:08:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 18:08:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=397, Unknown=1, NotChecked=0, Total=462 [2023-12-24 18:08:45,128 INFO L87 Difference]: Start difference. First operand 428 states and 546 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:08:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:08:58,054 INFO L93 Difference]: Finished difference Result 1120 states and 1432 transitions. [2023-12-24 18:08:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 18:08:58,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2023-12-24 18:08:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:08:58,059 INFO L225 Difference]: With dead ends: 1120 [2023-12-24 18:08:58,059 INFO L226 Difference]: Without dead ends: 693 [2023-12-24 18:08:58,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=120, Invalid=691, Unknown=1, NotChecked=0, Total=812 [2023-12-24 18:08:58,061 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 163 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2023-12-24 18:08:58,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1035 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2023-12-24 18:08:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2023-12-24 18:08:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 667. [2023-12-24 18:08:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 607 states have (on average 1.2339373970345964) internal successors, (749), 612 states have internal predecessors, (749), 50 states have call successors, (50), 9 states have call predecessors, (50), 9 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 18:08:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 849 transitions. [2023-12-24 18:08:58,113 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 849 transitions. Word has length 113 [2023-12-24 18:08:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:08:58,115 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 849 transitions. [2023-12-24 18:08:58,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:08:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 849 transitions. [2023-12-24 18:08:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-24 18:08:58,117 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:08:58,117 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:08:58,128 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 (19)] Ended with exit code 0 [2023-12-24 18:08:58,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-24 18:08:58,327 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:08:58,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:08:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash 579385451, now seen corresponding path program 1 times [2023-12-24 18:08:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:08:58,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635834857] [2023-12-24 18:08:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:08:58,328 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-24 18:08:58,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:08:58,329 INFO L229 MonitoredProcess]: Starting monitored process 20 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-24 18:08:58,362 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 (20)] Waiting until timeout for monitored process [2023-12-24 18:08:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:08:58,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-24 18:08:58,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:08:59,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-12-24 18:08:59,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:08:59,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 59 [2023-12-24 18:09:01,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:09:01,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 125 [2023-12-24 18:09:02,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:09:02,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 241 treesize of output 117 [2023-12-24 18:09:02,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:09:02,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 252 treesize of output 117 [2023-12-24 18:09:02,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:09:02,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 237 treesize of output 117 [2023-12-24 18:09:03,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:09:03,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 324 treesize of output 102 [2023-12-24 18:09:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 102 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-24 18:09:03,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 18:09:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 18:09:04,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:09:04,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635834857] [2023-12-24 18:09:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635834857] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 18:09:04,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 18:09:04,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2023-12-24 18:09:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079142986] [2023-12-24 18:09:04,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 18:09:04,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 18:09:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 18:09:04,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 18:09:04,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2023-12-24 18:09:04,120 INFO L87 Difference]: Start difference. First operand 667 states and 849 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:09:06,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 18:09:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 18:09:08,105 INFO L93 Difference]: Finished difference Result 1494 states and 1921 transitions. [2023-12-24 18:09:08,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 18:09:08,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2023-12-24 18:09:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 18:09:08,115 INFO L225 Difference]: With dead ends: 1494 [2023-12-24 18:09:08,115 INFO L226 Difference]: Without dead ends: 828 [2023-12-24 18:09:08,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2023-12-24 18:09:08,116 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 82 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-24 18:09:08,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 491 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-24 18:09:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2023-12-24 18:09:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 601. [2023-12-24 18:09:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 541 states have (on average 1.2365988909426988) internal successors, (669), 546 states have internal predecessors, (669), 50 states have call successors, (50), 9 states have call predecessors, (50), 9 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 18:09:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 769 transitions. [2023-12-24 18:09:08,157 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 769 transitions. Word has length 113 [2023-12-24 18:09:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 18:09:08,158 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 769 transitions. [2023-12-24 18:09:08,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 18:09:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 769 transitions. [2023-12-24 18:09:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-24 18:09:08,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 18:09:08,159 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 18:09:08,169 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 (20)] Forceful destruction successful, exit code 0 [2023-12-24 18:09:08,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-24 18:09:08,369 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 18:09:08,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 18:09:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash -977937017, now seen corresponding path program 1 times [2023-12-24 18:09:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 18:09:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10920805] [2023-12-24 18:09:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 18:09:08,370 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-24 18:09:08,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 18:09:08,371 INFO L229 MonitoredProcess]: Starting monitored process 21 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-24 18:09:08,374 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 (21)] Waiting until timeout for monitored process [2023-12-24 18:09:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 18:09:08,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-24 18:09:08,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 18:09:09,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-12-24 18:09:10,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:09:10,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 79 [2023-12-24 18:09:16,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:09:16,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 262 treesize of output 123 [2023-12-24 18:09:17,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:09:17,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 363 treesize of output 152 [2023-12-24 18:09:18,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:09:18,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 329 treesize of output 161 [2023-12-24 18:09:18,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 18:09:18,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 314 treesize of output 161 [2023-12-24 18:09:22,371 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-24 18:09:22,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-12-24 18:09:22,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 18:09:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10920805] [2023-12-24 18:09:22,373 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-24 18:09:22,381 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 (21)] Forceful destruction successful, exit code 0 [2023-12-24 18:09:22,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-24 18:09:22,574 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 44 more [2023-12-24 18:09:22,578 INFO L158 Benchmark]: Toolchain (without parser) took 597452.30ms. Allocated memory was 213.9MB in the beginning and 350.2MB in the end (delta: 136.3MB). Free memory was 147.3MB in the beginning and 254.0MB in the end (delta: -106.8MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2023-12-24 18:09:22,578 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 213.9MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 18:09:22,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.70ms. Allocated memory was 213.9MB in the beginning and 291.5MB in the end (delta: 77.6MB). Free memory was 147.0MB in the beginning and 254.3MB in the end (delta: -107.2MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2023-12-24 18:09:22,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.54ms. Allocated memory is still 291.5MB. Free memory was 254.3MB in the beginning and 250.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 18:09:22,578 INFO L158 Benchmark]: Boogie Preprocessor took 90.00ms. Allocated memory is still 291.5MB. Free memory was 250.3MB in the beginning and 252.6MB in the end (delta: -2.4MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2023-12-24 18:09:22,578 INFO L158 Benchmark]: RCFGBuilder took 805.06ms. Allocated memory is still 291.5MB. Free memory was 252.6MB in the beginning and 207.5MB in the end (delta: 45.1MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2023-12-24 18:09:22,579 INFO L158 Benchmark]: TraceAbstraction took 596163.93ms. Allocated memory was 291.5MB in the beginning and 350.2MB in the end (delta: 58.7MB). Free memory was 207.0MB in the beginning and 254.0MB in the end (delta: -47.0MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2023-12-24 18:09:22,579 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 213.9MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.70ms. Allocated memory was 213.9MB in the beginning and 291.5MB in the end (delta: 77.6MB). Free memory was 147.0MB in the beginning and 254.3MB in the end (delta: -107.2MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.54ms. Allocated memory is still 291.5MB. Free memory was 254.3MB in the beginning and 250.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 90.00ms. Allocated memory is still 291.5MB. Free memory was 250.3MB in the beginning and 252.6MB in the end (delta: -2.4MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * RCFGBuilder took 805.06ms. Allocated memory is still 291.5MB. Free memory was 252.6MB in the beginning and 207.5MB in the end (delta: 45.1MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * TraceAbstraction took 596163.93ms. Allocated memory was 291.5MB in the beginning and 350.2MB in the end (delta: 58.7MB). Free memory was 207.0MB in the beginning and 254.0MB in the end (delta: -47.0MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...