/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-4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:41:47,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:41:47,341 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:41:47,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:41:47,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:41:47,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:41:47,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:41:47,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:41:47,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:41:47,372 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:41:47,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:41:47,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:41:47,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:41:47,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:41:47,374 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:41:47,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:41:47,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:41:47,375 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:41:47,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:41:47,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:41:47,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:41:47,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:41:47,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:41:47,382 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:41:47,382 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:41:47,382 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:41:47,382 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:41:47,382 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:41:47,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:41:47,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:41:47,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:41:47,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:41:47,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:41:47,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:41:47,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:41:47,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:41:47,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:41:47,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:41:47,384 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:41:47,384 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:41:47,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:41:47,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:41:47,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:41:47,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:41:47,386 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:41:47,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:41:47,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:41:47,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:41:47,601 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:41:47,602 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:41:47,603 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-4.i [2024-11-05 19:41:48,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:41:49,083 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:41:49,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-4.i [2024-11-05 19:41:49,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311b1bc0b/b99314e0f28a438d89cffa2f9bc73230/FLAGa0cf4cecc [2024-11-05 19:41:49,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311b1bc0b/b99314e0f28a438d89cffa2f9bc73230 [2024-11-05 19:41:49,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:41:49,457 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:41:49,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:41:49,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:41:49,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:41:49,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee16f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49, skipping insertion in model container [2024-11-05 19:41:49,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:41:49,636 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-4.i[915,928] [2024-11-05 19:41:49,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:41:49,767 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:41:49,781 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-4.i[915,928] [2024-11-05 19:41:49,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:41:49,853 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:41:49,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49 WrapperNode [2024-11-05 19:41:49,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:41:49,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:41:49,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:41:49,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:41:49,859 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:41:49" (1/1) ... [2024-11-05 19:41:49,880 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:41:49" (1/1) ... [2024-11-05 19:41:49,911 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 348 [2024-11-05 19:41:49,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:41:49,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:41:49,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:41:49,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:41:49,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,950 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:41:49,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:41:49,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:41:49,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:41:49,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:41:49,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:41:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:41:50,024 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:41:50,026 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:41:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:41:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:41:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:41:50,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:41:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:41:50,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:41:50,161 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:41:50,187 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:42:00,018 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-05 19:42:00,018 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:42:00,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:42:00,035 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:42:00,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:42:00 BoogieIcfgContainer [2024-11-05 19:42:00,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:42:00,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:42:00,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:42:00,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:42:00,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:41:49" (1/3) ... [2024-11-05 19:42:00,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ecf426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:42:00, skipping insertion in model container [2024-11-05 19:42:00,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (2/3) ... [2024-11-05 19:42:00,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ecf426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:42:00, skipping insertion in model container [2024-11-05 19:42:00,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:42:00" (3/3) ... [2024-11-05 19:42:00,045 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-4.i [2024-11-05 19:42:00,058 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:42:00,059 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:42:00,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:42:00,115 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;@5310c3e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:42:00,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:42:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-05 19:42:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-05 19:42:00,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:42:00,138 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:00,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:42:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:42:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1204815028, now seen corresponding path program 1 times [2024-11-05 19:42:00,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:42:00,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [10390940] [2024-11-05 19:42:00,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:42:00,154 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:42:00,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:42:00,158 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:42:00,158 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:42:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:42:00,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:42:00,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:42:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1632 proven. 0 refuted. 0 times theorem prover too weak. 2692 trivial. 0 not checked. [2024-11-05 19:42:00,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:42:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 22 proven. 70 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2024-11-05 19:42:02,680 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:42:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [10390940] [2024-11-05 19:42:02,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [10390940] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:42:02,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:42:02,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:42:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209611687] [2024-11-05 19:42:02,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:42:02,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:42:02,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:42:02,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:42:02,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:42:02,707 INFO L87 Difference]: Start difference. First operand has 147 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-05 19:42:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:42:02,737 INFO L93 Difference]: Finished difference Result 287 states and 513 transitions. [2024-11-05 19:42:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:42:02,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 309 [2024-11-05 19:42:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:42:02,748 INFO L225 Difference]: With dead ends: 287 [2024-11-05 19:42:02,748 INFO L226 Difference]: Without dead ends: 143 [2024-11-05 19:42:02,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 616 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:42:02,754 INFO L432 NwaCegarLoop]: 228 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, 228 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:42:02,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:42:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-05 19:42:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-05 19:42:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-05 19:42:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 228 transitions. [2024-11-05 19:42:02,805 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 228 transitions. Word has length 309 [2024-11-05 19:42:02,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:42:02,806 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 228 transitions. [2024-11-05 19:42:02,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-05 19:42:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 228 transitions. [2024-11-05 19:42:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-05 19:42:02,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:42:02,813 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:02,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 19:42:03,014 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:42:03,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:42:03,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:42:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 377180634, now seen corresponding path program 1 times [2024-11-05 19:42:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:42:03,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [460606695] [2024-11-05 19:42:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:42:03,016 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:42:03,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:42:03,017 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:42:03,018 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:42:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:42:03,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 19:42:03,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:42:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1060 proven. 234 refuted. 0 times theorem prover too weak. 3030 trivial. 0 not checked. [2024-11-05 19:42:12,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:42:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 18 proven. 120 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2024-11-05 19:42:16,091 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:42:16,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [460606695] [2024-11-05 19:42:16,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [460606695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:42:16,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:42:16,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2024-11-05 19:42:16,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952658847] [2024-11-05 19:42:16,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:42:16,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-05 19:42:16,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:42:16,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-05 19:42:16,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-05 19:42:16,095 INFO L87 Difference]: Start difference. First operand 143 states and 228 transitions. Second operand has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 12 states have internal predecessors, (123), 4 states have call successors, (87), 3 states have call predecessors, (87), 5 states have return successors, (88), 4 states have call predecessors, (88), 4 states have call successors, (88) [2024-11-05 19:42:26,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:42:30,636 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:42:34,640 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:42:38,644 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:42:42,649 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:42:46,654 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:42:50,662 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:42:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:42:50,666 INFO L93 Difference]: Finished difference Result 293 states and 461 transitions. [2024-11-05 19:42:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-05 19:42:50,758 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 12 states have internal predecessors, (123), 4 states have call successors, (87), 3 states have call predecessors, (87), 5 states have return successors, (88), 4 states have call predecessors, (88), 4 states have call successors, (88) Word has length 309 [2024-11-05 19:42:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:42:50,762 INFO L225 Difference]: With dead ends: 293 [2024-11-05 19:42:50,762 INFO L226 Difference]: Without dead ends: 153 [2024-11-05 19:42:50,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-11-05 19:42:50,767 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 197 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 19 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2024-11-05 19:42:50,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 969 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 603 Invalid, 7 Unknown, 0 Unchecked, 34.0s Time] [2024-11-05 19:42:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-05 19:42:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-11-05 19:42:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-05 19:42:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 232 transitions. [2024-11-05 19:42:50,785 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 232 transitions. Word has length 309 [2024-11-05 19:42:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:42:50,786 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 232 transitions. [2024-11-05 19:42:50,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 12 states have internal predecessors, (123), 4 states have call successors, (87), 3 states have call predecessors, (87), 5 states have return successors, (88), 4 states have call predecessors, (88), 4 states have call successors, (88) [2024-11-05 19:42:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 232 transitions. [2024-11-05 19:42:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-05 19:42:50,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:42:50,790 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:50,820 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:42:50,991 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:42:50,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:42:50,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:42:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash 304794076, now seen corresponding path program 1 times [2024-11-05 19:42:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:42:50,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281237224] [2024-11-05 19:42:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:42:50,993 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:42:50,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:42:50,995 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:42:50,996 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:42:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:42:51,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 19:42:51,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:42:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 46 proven. 138 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2024-11-05 19:42:57,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:43:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2024-11-05 19:43:02,194 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:43:02,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281237224] [2024-11-05 19:43:02,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1281237224] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:43:02,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:43:02,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 19:43:02,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296728716] [2024-11-05 19:43:02,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:43:02,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 19:43:02,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:43:02,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 19:43:02,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 19:43:02,197 INFO L87 Difference]: Start difference. First operand 151 states and 232 transitions. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 3 states have call successors, (93), 2 states have call predecessors, (93), 4 states have return successors, (94), 2 states have call predecessors, (94), 3 states have call successors, (94) [2024-11-05 19:43:10,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:43:14,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:43:18,474 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:43:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:43:18,624 INFO L93 Difference]: Finished difference Result 300 states and 456 transitions. [2024-11-05 19:43:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 19:43:18,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 3 states have call successors, (93), 2 states have call predecessors, (93), 4 states have return successors, (94), 2 states have call predecessors, (94), 3 states have call successors, (94) Word has length 309 [2024-11-05 19:43:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:43:18,629 INFO L225 Difference]: With dead ends: 300 [2024-11-05 19:43:18,630 INFO L226 Difference]: Without dead ends: 152 [2024-11-05 19:43:18,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-05 19:43:18,631 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 297 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-05 19:43:18,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 356 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 284 Invalid, 3 Unknown, 0 Unchecked, 16.1s Time] [2024-11-05 19:43:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-05 19:43:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2024-11-05 19:43:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-05 19:43:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2024-11-05 19:43:18,655 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 222 transitions. Word has length 309 [2024-11-05 19:43:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:43:18,655 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 222 transitions. [2024-11-05 19:43:18,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 3 states have call successors, (93), 2 states have call predecessors, (93), 4 states have return successors, (94), 2 states have call predecessors, (94), 3 states have call successors, (94) [2024-11-05 19:43:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 222 transitions. [2024-11-05 19:43:18,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-05 19:43:18,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:43:18,657 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:18,684 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:43:18,858 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:43:18,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:43:18,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:43:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1690997470, now seen corresponding path program 1 times [2024-11-05 19:43:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:43:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [766879501] [2024-11-05 19:43:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:43:18,860 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:43:18,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:43:18,862 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:43:18,863 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:43:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:43:19,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 19:43:19,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:43:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1612 proven. 237 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2024-11-05 19:43:29,435 INFO L311 TraceCheckSpWp]: Computing backward predicates...