/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-sp_file-60.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 20:04:02,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 20:04:02,920 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 20:04:02,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 20:04:02,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 20:04:02,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 20:04:02,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 20:04:02,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 20:04:02,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 20:04:02,950 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 20:04:02,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 20:04:02,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 20:04:02,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 20:04:02,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 20:04:02,952 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 20:04:02,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 20:04:02,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 20:04:02,953 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 20:04:02,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 20:04:02,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 20:04:02,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 20:04:02,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 20:04:02,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 20:04:02,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 20:04:02,954 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 20:04:02,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 20:04:02,954 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 20:04:02,954 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 20:04:02,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 20:04:02,955 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 20:04:02,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 20:04:02,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 20:04:02,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 20:04:02,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 20:04:02,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:04:02,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 20:04:02,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 20:04:02,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 20:04:02,956 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 20:04:02,956 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 20:04:02,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 20:04:02,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 20:04:02,957 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 20:04:02,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 20:04:02,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 20:04:02,958 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 20:04:02,958 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 20:04:03,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 20:04:03,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 20:04:03,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 20:04:03,190 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 20:04:03,190 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 20:04:03,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i [2023-12-24 20:04:04,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 20:04:04,534 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 20:04:04,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i [2023-12-24 20:04:04,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4aff6f78/2c09ae3f6208478eb79fd693b4b0666e/FLAGb53a62ee0 [2023-12-24 20:04:04,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4aff6f78/2c09ae3f6208478eb79fd693b4b0666e [2023-12-24 20:04:04,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 20:04:04,565 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 20:04:04,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 20:04:04,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 20:04:04,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 20:04:04,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545f97a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04, skipping insertion in model container [2023-12-24 20:04:04,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,602 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:04:04,706 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-sp_file-60.i[917,930] [2023-12-24 20:04:04,749 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:04:04,768 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 20:04:04,776 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-sp_file-60.i[917,930] [2023-12-24 20:04:04,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:04:04,817 INFO L206 MainTranslator]: Completed translation [2023-12-24 20:04:04,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04 WrapperNode [2023-12-24 20:04:04,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 20:04:04,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 20:04:04,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 20:04:04,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 20:04:04,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,891 INFO L138 Inliner]: procedures = 36, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2023-12-24 20:04:04,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 20:04:04,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 20:04:04,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 20:04:04,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 20:04:04,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,946 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2023-12-24 20:04:04,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:04,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 20:04:04,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 20:04:04,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 20:04:04,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 20:04:04,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (1/1) ... [2023-12-24 20:04:05,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:04:05,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 20:04:05,021 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 20:04:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 20:04:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 20:04:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 20:04:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 20:04:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 20:04:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 20:04:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 20:04:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 20:04:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 20:04:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 20:04:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 20:04:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 20:04:05,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 20:04:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 20:04:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 20:04:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 20:04:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 20:04:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 20:04:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 20:04:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 20:04:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 20:04:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 20:04:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 20:04:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 20:04:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 20:04:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 20:04:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 20:04:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 20:04:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 20:04:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 20:04:05,192 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 20:04:05,193 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 20:04:08,120 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 20:04:08,184 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 20:04:08,184 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 20:04:08,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:04:08 BoogieIcfgContainer [2023-12-24 20:04:08,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 20:04:08,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 20:04:08,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 20:04:08,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 20:04:08,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:04:04" (1/3) ... [2023-12-24 20:04:08,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74044518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:04:08, skipping insertion in model container [2023-12-24 20:04:08,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:04:04" (2/3) ... [2023-12-24 20:04:08,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74044518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:04:08, skipping insertion in model container [2023-12-24 20:04:08,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:04:08" (3/3) ... [2023-12-24 20:04:08,191 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-60.i [2023-12-24 20:04:08,203 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 20:04:08,203 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 20:04:08,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 20:04:08,247 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;@157ee4ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 20:04:08,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 20:04:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 94 states have (on average 1.5) internal successors, (141), 95 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:04:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 20:04:08,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:08,266 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:08,266 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:08,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1978155358, now seen corresponding path program 1 times [2023-12-24 20:04:08,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:08,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739058762] [2023-12-24 20:04:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:08,280 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 20:04:08,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:08,282 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 20:04:08,304 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 20:04:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:08,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 20:04:08,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2023-12-24 20:04:08,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:08,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739058762] [2023-12-24 20:04:08,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739058762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:08,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:08,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 20:04:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144822254] [2023-12-24 20:04:08,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:08,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 20:04:08,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:08,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 20:04:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:04:08,996 INFO L87 Difference]: Start difference. First operand has 112 states, 94 states have (on average 1.5) internal successors, (141), 95 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 20:04:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:09,154 INFO L93 Difference]: Finished difference Result 221 states and 355 transitions. [2023-12-24 20:04:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 20:04:09,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2023-12-24 20:04:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:09,163 INFO L225 Difference]: With dead ends: 221 [2023-12-24 20:04:09,163 INFO L226 Difference]: Without dead ends: 110 [2023-12-24 20:04:09,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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 20:04:09,168 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 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.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:09,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:04:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-24 20:04:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-12-24 20:04:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:04:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 166 transitions. [2023-12-24 20:04:09,201 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 166 transitions. Word has length 129 [2023-12-24 20:04:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:09,201 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 166 transitions. [2023-12-24 20:04:09,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 20:04:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 166 transitions. [2023-12-24 20:04:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 20:04:09,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:09,205 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:09,227 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 20:04:09,406 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 20:04:09,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:09,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:09,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1006680812, now seen corresponding path program 1 times [2023-12-24 20:04:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:09,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474633848] [2023-12-24 20:04:09,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:09,408 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 20:04:09,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:09,410 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 20:04:09,411 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 20:04:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:09,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 20:04:09,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 20:04:10,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:10,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:10,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474633848] [2023-12-24 20:04:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474633848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:10,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 20:04:10,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178172837] [2023-12-24 20:04:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:10,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 20:04:10,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:10,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 20:04:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 20:04:10,042 INFO L87 Difference]: Start difference. First operand 110 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 20:04:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:10,691 INFO L93 Difference]: Finished difference Result 225 states and 340 transitions. [2023-12-24 20:04:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 20:04:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2023-12-24 20:04:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:10,693 INFO L225 Difference]: With dead ends: 225 [2023-12-24 20:04:10,693 INFO L226 Difference]: Without dead ends: 116 [2023-12-24 20:04:10,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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 20:04:10,695 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:10,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 479 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 20:04:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-24 20:04:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2023-12-24 20:04:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:04:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 168 transitions. [2023-12-24 20:04:10,707 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 168 transitions. Word has length 129 [2023-12-24 20:04:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:10,707 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 168 transitions. [2023-12-24 20:04:10,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 20:04:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 168 transitions. [2023-12-24 20:04:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 20:04:10,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:10,711 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:10,728 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 20:04:10,916 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 20:04:10,917 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:10,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash 866132202, now seen corresponding path program 1 times [2023-12-24 20:04:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835293621] [2023-12-24 20:04:10,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:10,920 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 20:04:10,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:10,921 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 20:04:10,951 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 20:04:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:11,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 20:04:11,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 20:04:11,551 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:11,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835293621] [2023-12-24 20:04:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835293621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:11,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:11,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:04:11,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18969822] [2023-12-24 20:04:11,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:11,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 20:04:11,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:11,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 20:04:11,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 20:04:11,553 INFO L87 Difference]: Start difference. First operand 112 states and 168 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 20:04:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:11,889 INFO L93 Difference]: Finished difference Result 259 states and 389 transitions. [2023-12-24 20:04:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:04:11,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-12-24 20:04:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:11,891 INFO L225 Difference]: With dead ends: 259 [2023-12-24 20:04:11,891 INFO L226 Difference]: Without dead ends: 148 [2023-12-24 20:04:11,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 20:04:11,893 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 94 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:11,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 635 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 20:04:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-24 20:04:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 116. [2023-12-24 20:04:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 99 states have internal predecessors, (142), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:04:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2023-12-24 20:04:11,900 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 129 [2023-12-24 20:04:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:11,901 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2023-12-24 20:04:11,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 20:04:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2023-12-24 20:04:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 20:04:11,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:11,903 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:11,938 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 20:04:12,124 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 20:04:12,125 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:12,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash 923390504, now seen corresponding path program 1 times [2023-12-24 20:04:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:12,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437246819] [2023-12-24 20:04:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:12,126 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 20:04:12,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:12,127 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 20:04:12,128 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 20:04:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:12,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 20:04:12,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:12,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:04:12,755 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 173 treesize of output 65 [2023-12-24 20:04:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 20:04:12,787 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:12,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:12,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437246819] [2023-12-24 20:04:12,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437246819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:12,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:12,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:04:12,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332303883] [2023-12-24 20:04:12,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:12,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:04:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:12,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:04:12,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:04:12,790 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 20:04:14,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 20:04:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:17,052 INFO L93 Difference]: Finished difference Result 237 states and 352 transitions. [2023-12-24 20:04:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:04:17,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-12-24 20:04:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:17,071 INFO L225 Difference]: With dead ends: 237 [2023-12-24 20:04:17,071 INFO L226 Difference]: Without dead ends: 122 [2023-12-24 20:04:17,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 20:04:17,073 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 176 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:17,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 425 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-24 20:04:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-24 20:04:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2023-12-24 20:04:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 99 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:04:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2023-12-24 20:04:17,082 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 129 [2023-12-24 20:04:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:17,082 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2023-12-24 20:04:17,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 20:04:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2023-12-24 20:04:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-24 20:04:17,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:17,085 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:17,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-24 20:04:17,289 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 20:04:17,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:17,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash 48348846, now seen corresponding path program 1 times [2023-12-24 20:04:17,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:17,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921389630] [2023-12-24 20:04:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:17,291 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 20:04:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:17,292 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 20:04:17,293 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 20:04:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:17,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 20:04:17,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:17,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:04:17,976 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 173 treesize of output 65 [2023-12-24 20:04:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 20:04:18,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:18,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921389630] [2023-12-24 20:04:18,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921389630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:18,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:18,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:04:18,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565582393] [2023-12-24 20:04:18,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:18,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:04:18,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:18,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:04:18,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:04:18,009 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 20:04:21,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 20:04:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:22,308 INFO L93 Difference]: Finished difference Result 237 states and 350 transitions. [2023-12-24 20:04:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:04:22,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2023-12-24 20:04:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:22,317 INFO L225 Difference]: With dead ends: 237 [2023-12-24 20:04:22,317 INFO L226 Difference]: Without dead ends: 122 [2023-12-24 20:04:22,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 20:04:22,318 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 163 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:22,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 419 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-24 20:04:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-24 20:04:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2023-12-24 20:04:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 99 states have internal predecessors, (140), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:04:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2023-12-24 20:04:22,325 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 131 [2023-12-24 20:04:22,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:22,326 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2023-12-24 20:04:22,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 20:04:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2023-12-24 20:04:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-24 20:04:22,327 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:22,327 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:22,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 20:04:22,543 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 20:04:22,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:22,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash -475731736, now seen corresponding path program 1 times [2023-12-24 20:04:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:22,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138956298] [2023-12-24 20:04:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:22,545 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 20:04:22,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:22,546 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 20:04:22,548 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 20:04:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:23,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 20:04:23,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:23,269 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 95 treesize of output 41 [2023-12-24 20:04:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 20:04:23,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:23,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:23,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138956298] [2023-12-24 20:04:23,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138956298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:23,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:23,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:04:23,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340210439] [2023-12-24 20:04:23,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:23,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:04:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:04:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:04:23,295 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 20:04:26,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 20:04:29,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 20:04:30,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 20:04:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:31,095 INFO L93 Difference]: Finished difference Result 237 states and 348 transitions. [2023-12-24 20:04:31,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:04:31,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2023-12-24 20:04:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:31,104 INFO L225 Difference]: With dead ends: 237 [2023-12-24 20:04:31,104 INFO L226 Difference]: Without dead ends: 122 [2023-12-24 20:04:31,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 20:04:31,105 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 130 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:31,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 414 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-12-24 20:04:31,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-24 20:04:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2023-12-24 20:04:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:04:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2023-12-24 20:04:31,110 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 133 [2023-12-24 20:04:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:31,110 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2023-12-24 20:04:31,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 20:04:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2023-12-24 20:04:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-24 20:04:31,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:31,111 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:31,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 20:04:31,333 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 20:04:31,334 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:31,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1653380974, now seen corresponding path program 1 times [2023-12-24 20:04:31,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:31,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776154081] [2023-12-24 20:04:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:31,335 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 20:04:31,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:31,336 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 20:04:31,337 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 20:04:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:31,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 20:04:31,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:32,187 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 95 treesize of output 41 [2023-12-24 20:04:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-12-24 20:04:32,231 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:32,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:32,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776154081] [2023-12-24 20:04:32,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776154081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:32,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:32,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:04:32,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108078870] [2023-12-24 20:04:32,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:32,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:04:32,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:04:32,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:04:32,233 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 20:04:34,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 20:04:38,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 20:04:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:39,402 INFO L93 Difference]: Finished difference Result 237 states and 346 transitions. [2023-12-24 20:04:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:04:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2023-12-24 20:04:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:39,412 INFO L225 Difference]: With dead ends: 237 [2023-12-24 20:04:39,412 INFO L226 Difference]: Without dead ends: 122 [2023-12-24 20:04:39,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 20:04:39,413 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 121 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:39,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 412 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-12-24 20:04:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-24 20:04:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2023-12-24 20:04:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:04:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2023-12-24 20:04:39,423 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 135 [2023-12-24 20:04:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:39,423 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2023-12-24 20:04:39,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 20:04:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2023-12-24 20:04:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-24 20:04:39,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:39,424 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:39,442 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 20:04:39,639 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 20:04:39,640 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:39,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:39,640 INFO L85 PathProgramCache]: Analyzing trace with hash 928484264, now seen corresponding path program 1 times [2023-12-24 20:04:39,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:39,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728122296] [2023-12-24 20:04:39,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:39,641 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 20:04:39,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:39,642 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 20:04:39,646 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 20:09:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:09:10,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-24 20:09:10,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:09:10,525 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 55 treesize of output 35 [2023-12-24 20:09:10,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 23 [2023-12-24 20:09:13,410 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 109 treesize of output 53 [2023-12-24 20:09:17,577 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 0 case distinctions, treesize of input 188 treesize of output 105 [2023-12-24 20:09:19,957 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 0 case distinctions, treesize of input 188 treesize of output 105 [2023-12-24 20:09:22,465 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 0 case distinctions, treesize of input 185 treesize of output 113 [2023-12-24 20:09:25,391 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 0 case distinctions, treesize of input 196 treesize of output 116 [2023-12-24 20:09:27,930 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 0 case distinctions, treesize of input 196 treesize of output 116 [2023-12-24 20:09:30,368 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 0 case distinctions, treesize of input 196 treesize of output 116 [2023-12-24 20:09:32,626 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 0 case distinctions, treesize of input 196 treesize of output 116 [2023-12-24 20:09:34,669 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 0 case distinctions, treesize of input 196 treesize of output 116 [2023-12-24 20:09:36,520 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 0 case distinctions, treesize of input 196 treesize of output 116 [2023-12-24 20:09:38,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 168 [2023-12-24 20:09:44,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 174 [2023-12-24 20:09:48,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 182 [2023-12-24 20:09:53,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 352 treesize of output 209 [2023-12-24 20:10:05,857 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 90 DAG size of output: 89 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 20:10:05,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:10:05,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 529 treesize of output 225 [2023-12-24 20:10:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 156 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-12-24 20:10:08,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:12:41,900 WARN L293 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 20:12:48,912 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_131| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_132| (_ BitVec 64)) (v_ArrVal_298 (_ BitVec 32)) (v_ArrVal_297 (_ BitVec 32)) (v_ArrVal_295 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (let ((.cse10 (let ((.cse17 (let ((.cse18 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_131|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_131|))))) (store .cse18 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse18 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_295))))) (store .cse17 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (store (select .cse17 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_297) (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_15_Pointer~0.offset) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_132|))))) (.cse6 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (.cse9 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (or (let ((.cse3 (store .cse10 c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_298)))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~WrapperStruct00_var_1_1_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.sub c_currentRoundingMode (let ((.cse4 (let ((.cse5 (select .cse3 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (let ((.cse8 (select .cse3 c_~WrapperStruct00_var_1_3_Pointer~0.base))) (concat (select .cse8 .cse9) (select .cse8 c_~WrapperStruct00_var_1_3_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))) (fp.gt (let ((.cse11 (let ((.cse12 (select .cse10 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse12 .cse6) (select .cse12 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))) ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_WrapperStruct00_var_1_16~0)) (not (= (fp.sub c_currentRoundingMode (let ((.cse13 (let ((.cse14 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse14 .cse6) (select .cse14 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) (let ((.cse15 (let ((.cse16 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_3_Pointer~0.base))) (concat (select .cse16 .cse9) (select .cse16 c_~WrapperStruct00_var_1_3_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_131|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_131|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_131|)))))))) is different from false [2023-12-24 20:12:52,957 WARN L876 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_131| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_132| (_ BitVec 64)) (v_ArrVal_298 (_ BitVec 32)) (v_ArrVal_297 (_ BitVec 32)) (v_ArrVal_295 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (let ((.cse10 (let ((.cse17 (let ((.cse18 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_131|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_131|))))) (store .cse18 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse18 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_295))))) (store .cse17 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (store (select .cse17 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_297) (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_15_Pointer~0.offset) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_132|))))) (.cse6 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (.cse9 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (or (let ((.cse3 (store .cse10 c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_298)))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~WrapperStruct00_var_1_1_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp.sub c_currentRoundingMode (let ((.cse4 (let ((.cse5 (select .cse3 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (let ((.cse8 (select .cse3 c_~WrapperStruct00_var_1_3_Pointer~0.base))) (concat (select .cse8 .cse9) (select .cse8 c_~WrapperStruct00_var_1_3_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))) (fp.gt (let ((.cse11 (let ((.cse12 (select .cse10 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse12 .cse6) (select .cse12 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))) ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_WrapperStruct00_var_1_16~0)) (not (= (fp.sub c_currentRoundingMode (let ((.cse13 (let ((.cse14 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse14 .cse6) (select .cse14 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) (let ((.cse15 (let ((.cse16 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_3_Pointer~0.base))) (concat (select .cse16 .cse9) (select .cse16 c_~WrapperStruct00_var_1_3_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_131|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_131|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_131|)))))))) is different from true [2023-12-24 20:13:00,031 WARN L293 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 20:13:08,127 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 20:13:12,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:13:12,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728122296] [2023-12-24 20:13:12,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728122296] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:13:12,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1273896275] [2023-12-24 20:13:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:13:12,827 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:13:12,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:13:12,865 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:13:12,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process Received shutdown request... [2023-12-24 20:18:48,472 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 20:18:48,472 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 20:18:48,487 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 20:18:49,564 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 20:18:49,673 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forcibly destroying the process [2023-12-24 20:18:49,688 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 20:18:49,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-24 20:18:49,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 137 [2023-12-24 20:18:49,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-24 20:18:49,761 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 20:18:49,761 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 138 with TraceHistMax 15,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleZ3 [831285267]. [2023-12-24 20:18:49,765 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:18:49,766 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 20:18:49,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 08:18:49 BoogieIcfgContainer [2023-12-24 20:18:49,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 20:18:49,768 INFO L158 Benchmark]: Toolchain (without parser) took 885203.32ms. Allocated memory is still 337.6MB. Free memory was 282.2MB in the beginning and 192.4MB in the end (delta: 89.8MB). Peak memory consumption was 90.3MB. Max. memory is 8.0GB. [2023-12-24 20:18:49,768 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 20:18:49,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.83ms. Allocated memory is still 337.6MB. Free memory was 282.2MB in the beginning and 264.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 20:18:49,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.35ms. Allocated memory is still 337.6MB. Free memory was 264.4MB in the beginning and 260.7MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 20:18:49,770 INFO L158 Benchmark]: Boogie Preprocessor took 83.13ms. Allocated memory is still 337.6MB. Free memory was 260.7MB in the beginning and 255.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 20:18:49,771 INFO L158 Benchmark]: RCFGBuilder took 3208.74ms. Allocated memory is still 337.6MB. Free memory was 255.4MB in the beginning and 279.3MB in the end (delta: -23.8MB). Peak memory consumption was 34.4MB. Max. memory is 8.0GB. [2023-12-24 20:18:49,772 INFO L158 Benchmark]: TraceAbstraction took 881581.47ms. Allocated memory is still 337.6MB. Free memory was 278.8MB in the beginning and 192.4MB in the end (delta: 86.4MB). Peak memory consumption was 86.4MB. Max. memory is 8.0GB. [2023-12-24 20:18:49,773 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.17ms. Allocated memory is still 209.7MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.83ms. Allocated memory is still 337.6MB. Free memory was 282.2MB in the beginning and 264.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.35ms. Allocated memory is still 337.6MB. Free memory was 264.4MB in the beginning and 260.7MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 83.13ms. Allocated memory is still 337.6MB. Free memory was 260.7MB in the beginning and 255.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 3208.74ms. Allocated memory is still 337.6MB. Free memory was 255.4MB in the beginning and 279.3MB in the end (delta: -23.8MB). Peak memory consumption was 34.4MB. Max. memory is 8.0GB. * TraceAbstraction took 881581.47ms. Allocated memory is still 337.6MB. Free memory was 278.8MB in the beginning and 192.4MB in the end (delta: 86.4MB). Peak memory consumption was 86.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 138 with TraceHistMax 15,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleZ3 [831285267]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 881.5s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 24.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 694 mSDsluCounter, 2946 SdHoareTripleChecker+Invalid, 23.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1979 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1021 IncrementalHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 967 mSDtfsCounter, 1021 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 928 GetRequests, 887 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=3, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 60 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 915 NumberOfCodeBlocks, 915 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 1614 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2299 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 2940/2940 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown