/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_amount250_file-98.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:50:11,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:50:11,106 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-05 19:50:11,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:50:11,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:50:11,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:50:11,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:50:11,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:50:11,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:50:11,145 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:50:11,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:50:11,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:50:11,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:50:11,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:50:11,149 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:50:11,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:50:11,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:50:11,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:50:11,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:50:11,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:50:11,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:50:11,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:50:11,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:50:11,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:50:11,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:50:11,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:50:11,156 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:50:11,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:50:11,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:50:11,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:50:11,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:50:11,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:50:11,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:50:11,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:50:11,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:50:11,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:50:11,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:50:11,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:50:11,162 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:50:11,162 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:50:11,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:50:11,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:50:11,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:50:11,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:50:11,163 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-05 19:50:11,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:50:11,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:50:11,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:50:11,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:50:11,441 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:50:11,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-98.i [2024-11-05 19:50:12,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:50:13,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:50:13,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-98.i [2024-11-05 19:50:13,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b326f5dc/7d5252c2e77b428cbd45cc651bbacc73/FLAG38021b642 [2024-11-05 19:50:13,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b326f5dc/7d5252c2e77b428cbd45cc651bbacc73 [2024-11-05 19:50:13,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:50:13,200 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:50:13,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:50:13,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:50:13,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:50:13,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7857a1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13, skipping insertion in model container [2024-11-05 19:50:13,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:50:13,446 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_amount250_file-98.i[916,929] [2024-11-05 19:50:13,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:50:13,626 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:50:13,639 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_amount250_file-98.i[916,929] [2024-11-05 19:50:13,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:50:13,774 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:50:13,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13 WrapperNode [2024-11-05 19:50:13,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:50:13,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:50:13,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:50:13,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:50:13,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,840 INFO L138 Inliner]: procedures = 27, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 330 [2024-11-05 19:50:13,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:50:13,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:50:13,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:50:13,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:50:13,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,902 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-05 19:50:13,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:50:13,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:50:13,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:50:13,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:50:13,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (1/1) ... [2024-11-05 19:50:13,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:50:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:50:14,003 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-05 19:50:14,010 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-05 19:50:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:50:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:50:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:50:14,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:50:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:50:14,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:50:14,140 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:50:14,142 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:50:23,855 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-05 19:50:23,855 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:50:23,876 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:50:23,877 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:50:23,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:50:23 BoogieIcfgContainer [2024-11-05 19:50:23,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:50:23,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:50:23,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:50:23,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:50:23,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:50:13" (1/3) ... [2024-11-05 19:50:23,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4f40c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:50:23, skipping insertion in model container [2024-11-05 19:50:23,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:50:13" (2/3) ... [2024-11-05 19:50:23,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4f40c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:50:23, skipping insertion in model container [2024-11-05 19:50:23,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:50:23" (3/3) ... [2024-11-05 19:50:23,891 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-98.i [2024-11-05 19:50:23,906 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:50:23,906 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:50:23,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:50:23,976 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;@74259be1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:50:23,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:50:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 98 states have (on average 1.530612244897959) internal successors, (150), 99 states have internal predecessors, (150), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-05 19:50:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-05 19:50:24,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:50:24,005 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:50:24,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:50:24,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:50:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash 36657279, now seen corresponding path program 1 times [2024-11-05 19:50:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:50:24,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1235036882] [2024-11-05 19:50:24,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:50:24,026 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-05 19:50:24,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:50:24,030 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-05 19:50:24,032 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-05 19:50:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:50:24,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:50:24,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:50:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1524 proven. 0 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2024-11-05 19:50:24,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:50:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 24 proven. 60 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2024-11-05 19:50:26,648 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:50:26,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1235036882] [2024-11-05 19:50:26,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1235036882] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:50:26,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:50:26,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:50:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701706606] [2024-11-05 19:50:26,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:50:26,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:50:26,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:50:26,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:50:26,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:50:26,683 INFO L87 Difference]: Start difference. First operand has 144 states, 98 states have (on average 1.530612244897959) internal successors, (150), 99 states have internal predecessors, (150), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-05 19:50:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:50:26,723 INFO L93 Difference]: Finished difference Result 281 states and 509 transitions. [2024-11-05 19:50:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:50:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 281 [2024-11-05 19:50:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:50:26,733 INFO L225 Difference]: With dead ends: 281 [2024-11-05 19:50:26,733 INFO L226 Difference]: Without dead ends: 140 [2024-11-05 19:50:26,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 560 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-05 19:50:26,741 INFO L432 NwaCegarLoop]: 229 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, 229 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-05 19:50:26,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:50:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-05 19:50:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-05 19:50:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 95 states have internal predecessors, (143), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-05 19:50:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2024-11-05 19:50:26,802 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 281 [2024-11-05 19:50:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:50:26,803 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2024-11-05 19:50:26,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-05 19:50:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2024-11-05 19:50:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-05 19:50:26,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:50:26,815 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:50:26,843 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-05 19:50:27,015 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-05 19:50:27,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:50:27,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:50:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1717858495, now seen corresponding path program 1 times [2024-11-05 19:50:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:50:27,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1148854871] [2024-11-05 19:50:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:50:27,018 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-05 19:50:27,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:50:27,021 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-05 19:50:27,023 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-05 19:50:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:50:27,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 19:50:27,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:50:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 516 proven. 117 refuted. 0 times theorem prover too weak. 2979 trivial. 0 not checked. [2024-11-05 19:50:37,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:50:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 9 proven. 117 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2024-11-05 19:50:42,575 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:50:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1148854871] [2024-11-05 19:50:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1148854871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:50:42,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:50:42,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-05 19:50:42,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371838034] [2024-11-05 19:50:42,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:50:42,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 19:50:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:50:42,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 19:50:42,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-05 19:50:42,586 INFO L87 Difference]: Start difference. First operand 140 states and 229 transitions. Second operand has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 4 states have call successors, (86), 3 states have call predecessors, (86), 5 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) [2024-11-05 19:50:51,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:55,781 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 [] [2024-11-05 19:50:59,790 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 [] [2024-11-05 19:51:03,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:51:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:51:03,626 INFO L93 Difference]: Finished difference Result 283 states and 460 transitions. [2024-11-05 19:51:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 19:51:03,704 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 4 states have call successors, (86), 3 states have call predecessors, (86), 5 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) Word has length 281 [2024-11-05 19:51:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:51:03,707 INFO L225 Difference]: With dead ends: 283 [2024-11-05 19:51:03,708 INFO L226 Difference]: Without dead ends: 146 [2024-11-05 19:51:03,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2024-11-05 19:51:03,710 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 627 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 194 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2024-11-05 19:51:03,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 527 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 383 Invalid, 3 Unknown, 0 Unchecked, 20.0s Time] [2024-11-05 19:51:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-05 19:51:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-11-05 19:51:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 98 states have internal predecessors, (145), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-05 19:51:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 231 transitions. [2024-11-05 19:51:03,748 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 231 transitions. Word has length 281 [2024-11-05 19:51:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:51:03,750 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 231 transitions. [2024-11-05 19:51:03,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 4 states have call successors, (86), 3 states have call predecessors, (86), 5 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) [2024-11-05 19:51:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 231 transitions. [2024-11-05 19:51:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-05 19:51:03,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:51:03,757 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:51:03,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 19:51:03,957 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-05 19:51:03,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:51:03,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:51:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1756843792, now seen corresponding path program 1 times [2024-11-05 19:51:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:51:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [554620275] [2024-11-05 19:51:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:51:03,960 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-05 19:51:03,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:51:03,963 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-05 19:51:03,964 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-05 19:51:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:51:04,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 19:51:04,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:51:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1836 proven. 57 refuted. 0 times theorem prover too weak. 1719 trivial. 0 not checked. [2024-11-05 19:51:07,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:51:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 69 proven. 57 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2024-11-05 19:51:09,950 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:51:09,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [554620275] [2024-11-05 19:51:09,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [554620275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:51:09,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:51:09,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 19:51:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869901550] [2024-11-05 19:51:09,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:51:09,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 19:51:09,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:51:09,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 19:51:09,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 19:51:09,953 INFO L87 Difference]: Start difference. First operand 144 states and 231 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-05 19:51:16,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:51:20,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:51:24,927 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 [] [2024-11-05 19:51:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:51:24,931 INFO L93 Difference]: Finished difference Result 290 states and 462 transitions. [2024-11-05 19:51:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 19:51:25,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 282 [2024-11-05 19:51:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:51:25,007 INFO L225 Difference]: With dead ends: 290 [2024-11-05 19:51:25,007 INFO L226 Difference]: Without dead ends: 149 [2024-11-05 19:51:25,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 556 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 19:51:25,010 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 242 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-11-05 19:51:25,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 429 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 236 Invalid, 3 Unknown, 0 Unchecked, 14.7s Time] [2024-11-05 19:51:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-05 19:51:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2024-11-05 19:51:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-05 19:51:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 229 transitions. [2024-11-05 19:51:25,039 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 229 transitions. Word has length 282 [2024-11-05 19:51:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:51:25,040 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 229 transitions. [2024-11-05 19:51:25,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-05 19:51:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 229 transitions. [2024-11-05 19:51:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-05 19:51:25,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:51:25,043 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:51:25,078 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-05 19:51:25,244 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-05 19:51:25,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:51:25,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:51:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2028650414, now seen corresponding path program 1 times [2024-11-05 19:51:25,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:51:25,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1291870499] [2024-11-05 19:51:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:51:25,246 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-05 19:51:25,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:51:25,248 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-05 19:51:25,249 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-05 19:51:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:51:26,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-05 19:51:26,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:51:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1971 proven. 276 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2024-11-05 19:51:40,298 INFO L311 TraceCheckSpWp]: Computing backward predicates...