/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-59.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 08:54:12,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 08:54:12,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 08:54:12,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 08:54:12,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 08:54:12,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 08:54:12,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 08:54:12,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 08:54:12,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 08:54:12,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 08:54:12,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 08:54:12,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 08:54:12,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 08:54:12,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 08:54:12,800 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 08:54:12,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 08:54:12,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 08:54:12,801 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 08:54:12,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 08:54:12,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 08:54:12,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 08:54:12,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 08:54:12,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 08:54:12,805 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 08:54:12,805 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 08:54:12,805 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 08:54:12,805 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 08:54:12,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 08:54:12,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 08:54:12,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 08:54:12,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 08:54:12,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 08:54:12,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 08:54:12,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 08:54:12,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:54:12,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 08:54:12,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 08:54:12,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 08:54:12,809 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 08:54:12,809 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 08:54:12,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 08:54:12,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 08:54:12,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 08:54:12,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 08:54:12,811 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:54:13,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 08:54:13,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 08:54:13,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 08:54:13,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 08:54:13,058 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 08:54:13,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-59.i [2024-11-03 08:54:14,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 08:54:14,617 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 08:54:14,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-59.i [2024-11-03 08:54:14,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aee8c39a/2878a7c466764a6299580b1e11172b2c/FLAG49485f628 [2024-11-03 08:54:14,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aee8c39a/2878a7c466764a6299580b1e11172b2c [2024-11-03 08:54:14,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 08:54:14,648 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 08:54:14,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 08:54:14,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 08:54:14,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 08:54:14,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:14,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398c812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14, skipping insertion in model container [2024-11-03 08:54:14,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:14,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 08:54:14,837 WARN L250 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_operatoramount_amount50_file-59.i[915,928] [2024-11-03 08:54:14,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:54:14,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 08:54:14,906 WARN L250 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_operatoramount_amount50_file-59.i[915,928] [2024-11-03 08:54:14,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:54:14,948 INFO L204 MainTranslator]: Completed translation [2024-11-03 08:54:14,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14 WrapperNode [2024-11-03 08:54:14,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 08:54:14,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 08:54:14,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 08:54:14,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 08:54:14,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:14,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:14,989 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2024-11-03 08:54:14,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 08:54:14,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 08:54:14,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 08:54:14,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 08:54:15,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:15,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:15,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:15,019 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-03 08:54:15,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:15,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:15,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:15,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:15,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:15,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:15,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 08:54:15,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 08:54:15,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 08:54:15,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 08:54:15,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (1/1) ... [2024-11-03 08:54:15,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:54:15,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 08:54:15,082 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) [2024-11-03 08:54:15,085 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 [2024-11-03 08:54:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 08:54:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 08:54:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 08:54:15,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 08:54:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 08:54:15,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 08:54:15,180 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 08:54:15,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 08:54:15,690 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-03 08:54:15,690 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 08:54:15,720 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 08:54:15,720 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 08:54:15,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:54:15 BoogieIcfgContainer [2024-11-03 08:54:15,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 08:54:15,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 08:54:15,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 08:54:15,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 08:54:15,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 08:54:14" (1/3) ... [2024-11-03 08:54:15,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb15cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:54:15, skipping insertion in model container [2024-11-03 08:54:15,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:54:14" (2/3) ... [2024-11-03 08:54:15,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb15cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:54:15, skipping insertion in model container [2024-11-03 08:54:15,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:54:15" (3/3) ... [2024-11-03 08:54:15,729 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-59.i [2024-11-03 08:54:15,741 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 08:54:15,741 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 08:54:15,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 08:54:15,801 INFO L333 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, 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;@66f0263a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 08:54:15,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 08:54:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-03 08:54:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-03 08:54:15,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:54:15,816 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:54:15,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:54:15,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:54:15,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1164860862, now seen corresponding path program 1 times [2024-11-03 08:54:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:54:15,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643198786] [2024-11-03 08:54:15,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:54:15,833 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 [2024-11-03 08:54:15,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:54:15,837 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) [2024-11-03 08:54:15,839 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 [2024-11-03 08:54:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:54:16,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 08:54:16,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:54:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-03 08:54:16,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:54:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-03 08:54:16,289 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:54:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643198786] [2024-11-03 08:54:16,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1643198786] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:54:16,290 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:54:16,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-03 08:54:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802479548] [2024-11-03 08:54:16,292 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:54:16,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 08:54:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:54:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 08:54:16,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 08:54:16,318 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-03 08:54:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:54:16,344 INFO L93 Difference]: Finished difference Result 101 states and 168 transitions. [2024-11-03 08:54:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 08:54:16,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-03 08:54:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:54:16,354 INFO L225 Difference]: With dead ends: 101 [2024-11-03 08:54:16,354 INFO L226 Difference]: Without dead ends: 50 [2024-11-03 08:54:16,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 08:54:16,360 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 08:54:16,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 08:54:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-03 08:54:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-03 08:54:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-03 08:54:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-03 08:54:16,393 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 95 [2024-11-03 08:54:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:54:16,394 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-03 08:54:16,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-03 08:54:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-03 08:54:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-03 08:54:16,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:54:16,398 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:54:16,410 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 [2024-11-03 08:54:16,598 WARN L453 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 [2024-11-03 08:54:16,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:54:16,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:54:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1236847222, now seen corresponding path program 1 times [2024-11-03 08:54:16,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:54:16,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [541241957] [2024-11-03 08:54:16,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:54:16,601 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 [2024-11-03 08:54:16,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:54:16,604 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) [2024-11-03 08:54:16,605 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 [2024-11-03 08:54:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:54:16,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 08:54:16,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:54:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-03 08:54:17,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:54:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-03 08:54:17,288 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:54:17,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [541241957] [2024-11-03 08:54:17,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [541241957] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:54:17,289 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:54:17,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2024-11-03 08:54:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999861462] [2024-11-03 08:54:17,290 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:54:17,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 08:54:17,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:54:17,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 08:54:17,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 08:54:17,294 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-03 08:54:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:54:18,026 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2024-11-03 08:54:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 08:54:18,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 95 [2024-11-03 08:54:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:54:18,040 INFO L225 Difference]: With dead ends: 163 [2024-11-03 08:54:18,040 INFO L226 Difference]: Without dead ends: 116 [2024-11-03 08:54:18,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-03 08:54:18,042 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 105 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-03 08:54:18,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 298 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-03 08:54:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-03 08:54:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 79. [2024-11-03 08:54:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-03 08:54:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-11-03 08:54:18,076 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 95 [2024-11-03 08:54:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:54:18,079 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-11-03 08:54:18,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-03 08:54:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-11-03 08:54:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-03 08:54:18,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:54:18,082 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:54:18,098 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 [2024-11-03 08:54:18,289 WARN L453 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 [2024-11-03 08:54:18,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:54:18,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:54:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1287173988, now seen corresponding path program 1 times [2024-11-03 08:54:18,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:54:18,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1845760847] [2024-11-03 08:54:18,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:54:18,292 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 [2024-11-03 08:54:18,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:54:18,295 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) [2024-11-03 08:54:18,296 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 [2024-11-03 08:54:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:54:18,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 08:54:18,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:54:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-03 08:54:18,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:54:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-03 08:54:18,898 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:54:18,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1845760847] [2024-11-03 08:54:18,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1845760847] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:54:18,898 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:54:18,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 4 [2024-11-03 08:54:18,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834285483] [2024-11-03 08:54:18,899 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:54:18,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 08:54:18,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:54:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 08:54:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-03 08:54:18,901 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-03 08:54:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:54:19,974 INFO L93 Difference]: Finished difference Result 183 states and 267 transitions. [2024-11-03 08:54:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 08:54:19,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 96 [2024-11-03 08:54:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:54:19,988 INFO L225 Difference]: With dead ends: 183 [2024-11-03 08:54:19,988 INFO L226 Difference]: Without dead ends: 136 [2024-11-03 08:54:19,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-03 08:54:19,990 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-03 08:54:19,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 201 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-03 08:54:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-03 08:54:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2024-11-03 08:54:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-03 08:54:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-11-03 08:54:20,032 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 96 [2024-11-03 08:54:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:54:20,033 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-11-03 08:54:20,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-03 08:54:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-11-03 08:54:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-03 08:54:20,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:54:20,035 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:54:20,045 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 [2024-11-03 08:54:20,239 WARN L453 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 [2024-11-03 08:54:20,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:54:20,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:54:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash 866463787, now seen corresponding path program 1 times [2024-11-03 08:54:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:54:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [53457627] [2024-11-03 08:54:20,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:54:20,242 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 [2024-11-03 08:54:20,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:54:20,245 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) [2024-11-03 08:54:20,246 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 [2024-11-03 08:54:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:54:20,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-03 08:54:20,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:54:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 183 proven. 90 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-03 08:54:22,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:55:49,044 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse6 (bvsdiv ((_ zero_extend 16) c_~var_1_6~0) .cse4)) (.cse3 ((_ zero_extend 16) c_~last_1_var_1_5~0)) (.cse1 ((_ zero_extend 16) c_~var_1_7~0))) (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (let ((.cse0 (bvsge .cse1 (_ bv16383 32)))) (and (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) .cse0) (or (not .cse0) (not (= |c_assume_abort_if_not_#in~cond| (_ bv1 32)))))) (exists ((v_subst_1 (_ BitVec 16))) (let ((.cse2 ((_ zero_extend 16) v_subst_1))) (and (bvsge .cse2 (_ bv16383 32)) (bvsgt .cse3 (bvadd .cse4 .cse2)) (bvsle .cse2 (_ bv32767 32))))) (not (bvsle .cse1 (_ bv32767 32))) (exists ((v_subst_2 (_ BitVec 16))) (let ((.cse8 ((_ zero_extend 16) v_subst_2))) (let ((.cse7 (bvadd .cse4 .cse8))) (and (let ((.cse5 ((_ zero_extend 16) ((_ extract 15 0) .cse7)))) (= .cse5 (bvmul .cse5 .cse6))) (bvsle .cse8 (_ bv32767 32)) (not (bvsgt .cse3 .cse7)) (bvsge .cse8 (_ bv16383 32)))))) (let ((.cse12 (bvadd .cse4 .cse1))) (let ((.cse10 (bvsgt .cse3 .cse12))) (and (or (not (let ((.cse9 ((_ zero_extend 16) ((_ extract 15 0) .cse3)))) (= .cse9 (bvmul .cse9 .cse6)))) (not .cse10)) (or .cse10 (not (let ((.cse11 ((_ zero_extend 16) ((_ extract 15 0) .cse12)))) (= .cse11 (bvmul .cse11 .cse6))))))))))) is different from true