/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 17:29:05,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 17:29:05,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 17:29:05,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 17:29:05,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 17:29:05,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 17:29:05,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 17:29:05,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 17:29:05,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 17:29:05,308 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 17:29:05,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 17:29:05,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 17:29:05,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 17:29:05,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 17:29:05,310 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 17:29:05,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 17:29:05,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 17:29:05,310 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 17:29:05,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 17:29:05,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 17:29:05,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 17:29:05,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 17:29:05,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 17:29:05,312 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 17:29:05,312 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 17:29:05,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 17:29:05,313 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 17:29:05,313 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 17:29:05,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 17:29:05,313 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 17:29:05,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 17:29:05,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 17:29:05,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 17:29:05,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 17:29:05,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 17:29:05,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 17:29:05,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 17:29:05,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 17:29:05,315 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 17:29:05,315 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 17:29:05,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 17:29:05,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 17:29:05,316 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 17:29:05,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 17:29:05,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 17:29:05,316 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 17:29:05,317 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 17:29:05,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 17:29:05,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 17:29:05,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 17:29:05,530 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 17:29:05,530 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 17:29:05,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2023-12-24 17:29:06,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 17:29:06,754 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 17:29:06,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2023-12-24 17:29:06,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8acda04b/7c31263da4224fd5a1f13ccf2b18f15a/FLAGa7d50fd6e [2023-12-24 17:29:06,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8acda04b/7c31263da4224fd5a1f13ccf2b18f15a [2023-12-24 17:29:06,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 17:29:06,786 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 17:29:06,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 17:29:06,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 17:29:06,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 17:29:06,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:29:06" (1/1) ... [2023-12-24 17:29:06,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4076df9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:06, skipping insertion in model container [2023-12-24 17:29:06,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:29:06" (1/1) ... [2023-12-24 17:29:06,815 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 17:29:06,920 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i[915,928] [2023-12-24 17:29:06,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 17:29:06,967 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 17:29:06,989 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i[915,928] [2023-12-24 17:29:07,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 17:29:07,033 INFO L206 MainTranslator]: Completed translation [2023-12-24 17:29:07,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07 WrapperNode [2023-12-24 17:29:07,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 17:29:07,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 17:29:07,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 17:29:07,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 17:29:07,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,080 INFO L138 Inliner]: procedures = 33, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 359 [2023-12-24 17:29:07,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 17:29:07,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 17:29:07,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 17:29:07,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 17:29:07,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,112 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2023-12-24 17:29:07,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 17:29:07,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 17:29:07,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 17:29:07,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 17:29:07,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (1/1) ... [2023-12-24 17:29:07,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 17:29:07,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 17:29:07,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 17:29:07,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 17:29:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 17:29:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 17:29:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 17:29:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 17:29:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 17:29:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 17:29:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 17:29:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 17:29:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 17:29:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 17:29:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 17:29:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 17:29:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 17:29:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 17:29:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 17:29:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 17:29:07,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 17:29:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 17:29:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 17:29:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 17:29:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 17:29:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 17:29:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 17:29:07,295 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 17:29:07,296 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 17:29:27,494 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 17:29:27,544 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 17:29:27,544 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 17:29:27,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:29:27 BoogieIcfgContainer [2023-12-24 17:29:27,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 17:29:27,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 17:29:27,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 17:29:27,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 17:29:27,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 05:29:06" (1/3) ... [2023-12-24 17:29:27,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec95d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:29:27, skipping insertion in model container [2023-12-24 17:29:27,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:29:07" (2/3) ... [2023-12-24 17:29:27,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec95d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:29:27, skipping insertion in model container [2023-12-24 17:29:27,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:29:27" (3/3) ... [2023-12-24 17:29:27,551 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-0.i [2023-12-24 17:29:27,598 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 17:29:27,598 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 17:29:27,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 17:29:27,661 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;@6a20c8e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 17:29:27,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 17:29:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 17:29:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-24 17:29:27,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:29:27,688 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:29:27,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:29:27,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:29:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1941354024, now seen corresponding path program 1 times [2023-12-24 17:29:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:29:27,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349851193] [2023-12-24 17:29:27,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:29:27,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:29:27,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:29:27,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 17:29:27,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 17:29:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:29:28,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 17:29:28,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:29:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-24 17:29:28,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:29:28,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:29:28,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349851193] [2023-12-24 17:29:28,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349851193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:29:28,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:29:28,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 17:29:28,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452688900] [2023-12-24 17:29:28,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:29:28,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 17:29:28,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:29:28,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 17:29:28,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 17:29:28,223 INFO L87 Difference]: Start difference. First operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 68 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 17:29:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:29:28,279 INFO L93 Difference]: Finished difference Result 150 states and 235 transitions. [2023-12-24 17:29:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 17:29:28,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2023-12-24 17:29:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:29:28,285 INFO L225 Difference]: With dead ends: 150 [2023-12-24 17:29:28,286 INFO L226 Difference]: Without dead ends: 73 [2023-12-24 17:29:28,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 17:29:28,290 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:29:28,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:29:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-24 17:29:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-24 17:29:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 17:29:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2023-12-24 17:29:28,324 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 73 [2023-12-24 17:29:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:29:28,324 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2023-12-24 17:29:28,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 17:29:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2023-12-24 17:29:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-24 17:29:28,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:29:28,327 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:29:28,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 17:29:28,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:29:28,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:29:28,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:29:28,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1065954572, now seen corresponding path program 1 times [2023-12-24 17:29:28,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:29:28,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982499333] [2023-12-24 17:29:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:29:28,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:29:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:29:28,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 17:29:28,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 17:29:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:29:28,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 17:29:28,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:29:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 17:29:28,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:29:28,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:29:28,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982499333] [2023-12-24 17:29:28,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982499333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:29:28,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:29:28,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 17:29:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098510481] [2023-12-24 17:29:28,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:29:28,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 17:29:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:29:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 17:29:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 17:29:28,997 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 17:29:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:29:29,121 INFO L93 Difference]: Finished difference Result 151 states and 214 transitions. [2023-12-24 17:29:29,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 17:29:29,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2023-12-24 17:29:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:29:29,123 INFO L225 Difference]: With dead ends: 151 [2023-12-24 17:29:29,123 INFO L226 Difference]: Without dead ends: 79 [2023-12-24 17:29:29,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 17:29:29,124 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 10 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:29:29,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:29:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-24 17:29:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2023-12-24 17:29:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 17:29:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2023-12-24 17:29:29,131 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 73 [2023-12-24 17:29:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:29:29,131 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2023-12-24 17:29:29,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 17:29:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2023-12-24 17:29:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-24 17:29:29,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:29:29,144 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:29:29,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 17:29:29,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:29:29,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:29:29,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:29:29,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1626654350, now seen corresponding path program 1 times [2023-12-24 17:29:29,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:29:29,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495738049] [2023-12-24 17:29:29,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:29:29,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:29:29,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:29:29,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 17:29:29,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 17:29:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:29:29,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 17:29:29,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:29:29,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:29:29,918 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 17:29:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 17:29:29,985 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:29:29,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:29:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495738049] [2023-12-24 17:29:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495738049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:29:29,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:29:29,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 17:29:29,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339348194] [2023-12-24 17:29:29,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:29:29,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 17:29:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:29:29,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 17:29:29,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 17:29:29,987 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 17:29:34,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:29:38,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 17:29:42,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 17:29:44,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:29:48,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:29:49,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:29:53,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:29:55,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:29:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:29:56,485 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions. [2023-12-24 17:29:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 17:29:56,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2023-12-24 17:29:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:29:56,530 INFO L225 Difference]: With dead ends: 153 [2023-12-24 17:29:56,530 INFO L226 Difference]: Without dead ends: 79 [2023-12-24 17:29:56,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 17:29:56,531 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2023-12-24 17:29:56,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 250 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 26.4s Time] [2023-12-24 17:29:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-24 17:29:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2023-12-24 17:29:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 17:29:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2023-12-24 17:29:56,541 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 73 [2023-12-24 17:29:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:29:56,542 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2023-12-24 17:29:56,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 17:29:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2023-12-24 17:29:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 17:29:56,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:29:56,543 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:29:56,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 17:29:56,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:29:56,776 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:29:56,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:29:56,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1871300666, now seen corresponding path program 1 times [2023-12-24 17:29:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:29:56,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36693598] [2023-12-24 17:29:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:29:56,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:29:56,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:29:56,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 17:29:56,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 17:29:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:29:57,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 17:29:57,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:29:57,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:29:57,473 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 172 treesize of output 64 [2023-12-24 17:29:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-24 17:29:57,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:29:58,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:29:58,002 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 110 treesize of output 1 [2023-12-24 17:29:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-24 17:29:58,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:29:58,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36693598] [2023-12-24 17:29:58,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36693598] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 17:29:58,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 17:29:58,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-12-24 17:29:58,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425211766] [2023-12-24 17:29:58,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 17:29:58,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 17:29:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:29:58,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 17:29:58,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-24 17:29:58,009 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-24 17:30:03,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:04,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:08,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:10,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:18,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:22,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:24,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:29,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:33,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:30:33,357 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2023-12-24 17:30:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 17:30:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 75 [2023-12-24 17:30:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:30:33,408 INFO L225 Difference]: With dead ends: 158 [2023-12-24 17:30:33,408 INFO L226 Difference]: Without dead ends: 75 [2023-12-24 17:30:33,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2023-12-24 17:30:33,410 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 9 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.8s IncrementalHoareTripleChecker+Time [2023-12-24 17:30:33,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 390 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 320 Invalid, 5 Unknown, 0 Unchecked, 34.8s Time] [2023-12-24 17:30:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-24 17:30:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2023-12-24 17:30:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 17:30:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2023-12-24 17:30:33,415 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 75 [2023-12-24 17:30:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:30:33,415 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2023-12-24 17:30:33,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-24 17:30:33,415 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2023-12-24 17:30:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 17:30:33,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:30:33,418 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:30:33,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 17:30:33,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:30:33,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:30:33,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:30:33,619 INFO L85 PathProgramCache]: Analyzing trace with hash -90273992, now seen corresponding path program 1 times [2023-12-24 17:30:33,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:30:33,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832880142] [2023-12-24 17:30:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:30:33,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:30:33,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:30:33,622 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 17:30:33,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 17:30:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:30:34,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 17:30:34,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:30:34,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:30:34,235 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 17:30:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-24 17:30:34,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:30:34,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:30:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832880142] [2023-12-24 17:30:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832880142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:30:34,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:30:34,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 17:30:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530812784] [2023-12-24 17:30:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:30:34,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 17:30:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:30:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 17:30:34,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 17:30:34,288 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 17:30:38,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:42,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:46,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:50,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:55,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 17:30:59,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:31:01,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:31:03,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:31:08,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:31:13,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 17:31:17,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:31:21,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 17:31:23,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 17:31:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:31:23,783 INFO L93 Difference]: Finished difference Result 151 states and 208 transitions. [2023-12-24 17:31:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 17:31:23,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2023-12-24 17:31:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:31:23,831 INFO L225 Difference]: With dead ends: 151 [2023-12-24 17:31:23,831 INFO L226 Difference]: Without dead ends: 79 [2023-12-24 17:31:23,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 17:31:23,832 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 93 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.3s IncrementalHoareTripleChecker+Time [2023-12-24 17:31:23,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 240 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 10 Unknown, 0 Unchecked, 49.3s Time] [2023-12-24 17:31:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-24 17:31:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2023-12-24 17:31:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 17:31:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2023-12-24 17:31:23,837 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 75 [2023-12-24 17:31:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:31:23,837 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2023-12-24 17:31:23,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 17:31:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2023-12-24 17:31:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-24 17:31:23,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:31:23,838 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:31:23,854 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 17:31:24,041 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 17:31:24,041 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:31:24,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:31:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2015118386, now seen corresponding path program 1 times [2023-12-24 17:31:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:31:24,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326341543] [2023-12-24 17:31:24,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:31:24,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:31:24,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:31:24,044 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 17:31:24,045 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 17:31:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:31:28,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-24 17:31:28,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:31:28,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 17:31:30,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:31:30,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 67 [2023-12-24 17:31:37,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:31:37,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 245 treesize of output 127 [2023-12-24 17:31:38,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:31:38,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 225 treesize of output 146 [2023-12-24 17:31:40,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:31:40,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 347 treesize of output 203 [2023-12-24 17:31:45,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:31:45,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 539 treesize of output 199 [2023-12-24 17:32:02,381 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:32:10,499 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:32:16,073 WARN L293 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:32:24,200 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:32:32,372 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:32:38,329 WARN L293 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:32:42,379 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_27 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_51| (_ BitVec 64)) (v_arrayElimCell_29 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_52| (_ BitVec 64))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (.cse0 (let ((.cse7 (concat v_arrayElimCell_28 v_arrayElimCell_27))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))) (.cse2 (let ((.cse6 (concat v_arrayElimCell_29 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_51|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (and (fp.geq .cse0 .cse1) (= (fp.sub roundNearestTiesToEven .cse0 .cse2) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_52|))) (fp.leq .cse0 .cse3) (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1) (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_52|)))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (fp.eq (fp.add roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 .cse4)) .cse4))))) is different from false [2023-12-24 17:32:46,404 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_27 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_51| (_ BitVec 64)) (v_arrayElimCell_29 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_52| (_ BitVec 64))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (.cse0 (let ((.cse7 (concat v_arrayElimCell_28 v_arrayElimCell_27))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))) (.cse2 (let ((.cse6 (concat v_arrayElimCell_29 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_51|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (and (fp.geq .cse0 .cse1) (= (fp.sub roundNearestTiesToEven .cse0 .cse2) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_52|))) (fp.leq .cse0 .cse3) (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse1) (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_52|)))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (fp.eq (fp.add roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 .cse4)) .cse4))))) is different from true [2023-12-24 17:32:58,551 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:33:06,728 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:33:19,795 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:33:27,913 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:33:34,921 WARN L293 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:33:47,079 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:33:55,240 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:34:00,286 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:34:08,431 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:34:16,549 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:34:24,631 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:34:36,790 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:34:44,931 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:34:53,062 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:35:01,198 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:35:09,341 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:35:17,426 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:35:29,605 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:35:37,741 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:35:50,840 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:35:58,955 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:36:04,765 WARN L293 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:36:16,961 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:36:22,734 WARN L293 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:36:30,732 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:36:38,861 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:36:46,993 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:36:54,603 WARN L293 SmtUtils]: Spent 7.61s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:37:06,806 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:37:14,954 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:37:20,206 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:37:28,327 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:37:36,482 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:37:43,277 WARN L293 SmtUtils]: Spent 6.79s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:37:53,704 WARN L293 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:38:01,850 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:38:07,060 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:38:15,198 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:38:23,364 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:38:30,595 WARN L293 SmtUtils]: Spent 7.23s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:38:42,008 WARN L293 SmtUtils]: Spent 7.38s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:38:50,144 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:38:58,281 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:39:06,472 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:39:14,589 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:39:20,826 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:39:33,019 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:39:41,196 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:39:46,312 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:39:54,427 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:40:02,539 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:40:09,936 WARN L293 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:40:20,182 WARN L293 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:40:28,324 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:40:34,225 WARN L293 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:40:42,325 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:40:50,458 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:40:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-24 17:40:55,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:43:08,931 WARN L293 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 17:43:18,074 WARN L293 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:43:23,145 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_52| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_int#1| |c_~#WrapperStruct0~0.base|))) (let ((.cse0 (let ((.cse6 (concat (select .cse5 (bvadd |c_~#WrapperStruct0~0.offset| (_ bv13 32))) (select .cse5 (bvadd |c_~#WrapperStruct0~0.offset| (_ bv9 32)))))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6)))) (.cse1 (let ((.cse4 (concat (select .cse5 (bvadd |c_~#WrapperStruct0~0.offset| (_ bv21 32))) (select .cse5 (bvadd (_ bv17 32) |c_~#WrapperStruct0~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (or (not (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_52|)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.eq (fp.add c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode .cse1 .cse2)) .cse2))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_52|)) (fp.sub c_currentRoundingMode .cse0 .cse1))))))) is different from false [2023-12-24 17:43:27,201 WARN L876 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_52| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_int#1| |c_~#WrapperStruct0~0.base|))) (let ((.cse0 (let ((.cse6 (concat (select .cse5 (bvadd |c_~#WrapperStruct0~0.offset| (_ bv13 32))) (select .cse5 (bvadd |c_~#WrapperStruct0~0.offset| (_ bv9 32)))))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6)))) (.cse1 (let ((.cse4 (concat (select .cse5 (bvadd |c_~#WrapperStruct0~0.offset| (_ bv21 32))) (select .cse5 (bvadd (_ bv17 32) |c_~#WrapperStruct0~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (or (not (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_52|)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.eq (fp.add c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode .cse1 .cse2)) .cse2))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_52|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_52|)) (fp.sub c_currentRoundingMode .cse0 .cse1))))))) is different from true [2023-12-24 17:43:35,360 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:43:40,679 WARN L293 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:43:48,845 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-24 17:43:54,090 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 17:43:54,111 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 17:43:55,142 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 17:43:55,291 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 17:43:55,418 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 17:43:55,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 17:43:55,421 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 78 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-24 17:43:55,424 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-24 17:43:55,441 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 17:43:55,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 05:43:55 BoogieIcfgContainer [2023-12-24 17:43:55,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 17:43:55,445 INFO L158 Benchmark]: Toolchain (without parser) took 888659.22ms. Allocated memory is still 246.4MB. Free memory was 205.4MB in the beginning and 113.6MB in the end (delta: 91.8MB). Peak memory consumption was 92.6MB. Max. memory is 8.0GB. [2023-12-24 17:43:55,445 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 204.5MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 17:43:55,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.35ms. Allocated memory is still 246.4MB. Free memory was 205.4MB in the beginning and 190.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 17:43:55,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.69ms. Allocated memory is still 246.4MB. Free memory was 190.0MB in the beginning and 186.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 17:43:55,449 INFO L158 Benchmark]: Boogie Preprocessor took 66.09ms. Allocated memory is still 246.4MB. Free memory was 186.9MB in the beginning and 182.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 17:43:55,450 INFO L158 Benchmark]: RCFGBuilder took 20396.85ms. Allocated memory is still 246.4MB. Free memory was 182.7MB in the beginning and 148.1MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-24 17:43:55,451 INFO L158 Benchmark]: TraceAbstraction took 867897.92ms. Allocated memory is still 246.4MB. Free memory was 147.4MB in the beginning and 113.6MB in the end (delta: 33.8MB). Peak memory consumption was 35.0MB. Max. memory is 8.0GB. [2023-12-24 17:43:55,452 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 204.5MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.35ms. Allocated memory is still 246.4MB. Free memory was 205.4MB in the beginning and 190.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.69ms. Allocated memory is still 246.4MB. Free memory was 190.0MB in the beginning and 186.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.09ms. Allocated memory is still 246.4MB. Free memory was 186.9MB in the beginning and 182.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 20396.85ms. Allocated memory is still 246.4MB. Free memory was 182.7MB in the beginning and 148.1MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 867897.92ms. Allocated memory is still 246.4MB. Free memory was 147.4MB in the beginning and 113.6MB in the end (delta: 33.8MB). Peak memory consumption was 35.0MB. 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 78 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 867.8s, OverallIterations: 6, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 111.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 110.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 1265 SdHoareTripleChecker+Invalid, 109.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 858 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 407 mSDtfsCounter, 634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 1310 SizeOfPredicates, 26 NumberOfNonLiveVariables, 876 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 649/672 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