/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-05 23:20:55,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 23:20:55,842 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 23:20:55,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 23:20:55,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 23:20:55,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 23:20:55,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 23:20:55,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 23:20:55,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 23:20:55,881 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 23:20:55,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 23:20:55,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 23:20:55,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 23:20:55,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 23:20:55,885 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 23:20:55,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 23:20:55,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 23:20:55,886 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 23:20:55,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 23:20:55,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 23:20:55,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 23:20:55,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 23:20:55,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 23:20:55,891 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 23:20:55,891 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 23:20:55,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 23:20:55,892 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 23:20:55,892 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 23:20:55,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 23:20:55,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 23:20:55,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 23:20:55,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 23:20:55,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 23:20:55,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 23:20:55,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:20:55,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 23:20:55,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 23:20:55,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 23:20:55,895 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 23:20:55,895 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 23:20:55,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 23:20:55,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 23:20:55,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 23:20:55,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 23:20:55,896 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.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-05 23:20:56,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 23:20:56,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 23:20:56,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 23:20:56,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 23:20:56,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 23:20:56,167 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-2.i [2024-11-05 23:20:57,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 23:20:57,916 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 23:20:57,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-2.i [2024-11-05 23:20:57,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dfd2e5f2/2e39242471e5482b8e017a756666b4cc/FLAG08a6baf9f [2024-11-05 23:20:57,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dfd2e5f2/2e39242471e5482b8e017a756666b4cc [2024-11-05 23:20:57,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 23:20:57,961 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 23:20:57,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 23:20:57,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 23:20:57,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 23:20:57,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:20:57" (1/1) ... [2024-11-05 23:20:57,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ec50b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:57, skipping insertion in model container [2024-11-05 23:20:57,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:20:57" (1/1) ... [2024-11-05 23:20:58,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 23:20:58,227 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-2.i[915,928] [2024-11-05 23:20:58,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:20:58,431 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 23:20:58,443 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-2.i[915,928] [2024-11-05 23:20:58,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:20:58,559 INFO L204 MainTranslator]: Completed translation [2024-11-05 23:20:58,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58 WrapperNode [2024-11-05 23:20:58,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 23:20:58,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 23:20:58,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 23:20:58,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 23:20:58,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,640 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 347 [2024-11-05 23:20:58,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 23:20:58,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 23:20:58,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 23:20:58,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 23:20:58,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,693 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 23:20:58,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 23:20:58,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 23:20:58,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 23:20:58,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 23:20:58,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (1/1) ... [2024-11-05 23:20:58,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:20:58,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 23:20:58,791 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 23:20:58,798 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 23:20:58,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 23:20:58,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 23:20:58,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 23:20:58,826 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 23:20:58,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 23:20:58,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 23:20:58,985 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 23:20:58,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 23:21:31,694 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-05 23:21:31,694 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 23:21:31,709 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 23:21:31,709 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 23:21:31,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:21:31 BoogieIcfgContainer [2024-11-05 23:21:31,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 23:21:31,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 23:21:31,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 23:21:31,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 23:21:31,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:20:57" (1/3) ... [2024-11-05 23:21:31,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd6bcd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:21:31, skipping insertion in model container [2024-11-05 23:21:31,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:20:58" (2/3) ... [2024-11-05 23:21:31,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd6bcd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:21:31, skipping insertion in model container [2024-11-05 23:21:31,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:21:31" (3/3) ... [2024-11-05 23:21:31,722 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-2.i [2024-11-05 23:21:31,734 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 23:21:31,734 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 23:21:31,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 23:21:31,803 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;@47a7c271, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 23:21:31,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 23:21:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 98 states have (on average 1.5) internal successors, (147), 99 states have internal predecessors, (147), 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 23:21:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-05 23:21:31,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:21:31,825 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] [2024-11-05 23:21:31,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:21:31,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:21:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1593596933, now seen corresponding path program 1 times [2024-11-05 23:21:31,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:21:31,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789335195] [2024-11-05 23:21:31,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:21:31,848 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 23:21:31,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:21:31,851 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 23:21:31,853 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 23:21:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:21:33,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 23:21:33,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:21:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2024-11-05 23:21:33,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:21:33,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:21:33,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789335195] [2024-11-05 23:21:33,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789335195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:21:33,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:21:33,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 23:21:33,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97475430] [2024-11-05 23:21:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:21:33,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 23:21:33,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:21:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 23:21:33,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:21:33,516 INFO L87 Difference]: Start difference. First operand has 148 states, 98 states have (on average 1.5) internal successors, (147), 99 states have internal predecessors, (147), 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 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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 23:21:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:21:33,558 INFO L93 Difference]: Finished difference Result 289 states and 523 transitions. [2024-11-05 23:21:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 23:21:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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 304 [2024-11-05 23:21:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:21:33,573 INFO L225 Difference]: With dead ends: 289 [2024-11-05 23:21:33,574 INFO L226 Difference]: Without dead ends: 144 [2024-11-05 23:21:33,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 303 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 23:21:33,588 INFO L432 NwaCegarLoop]: 234 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, 234 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 23:21:33,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 23:21:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-05 23:21:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-05 23:21:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 95 states have internal predecessors, (140), 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 23:21:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 234 transitions. [2024-11-05 23:21:33,645 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 234 transitions. Word has length 304 [2024-11-05 23:21:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:21:33,645 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 234 transitions. [2024-11-05 23:21:33,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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 23:21:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 234 transitions. [2024-11-05 23:21:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-05 23:21:33,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:21:33,661 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] [2024-11-05 23:21:33,721 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 23:21:33,862 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 23:21:33,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:21:33,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:21:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1975020293, now seen corresponding path program 1 times [2024-11-05 23:21:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:21:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955582152] [2024-11-05 23:21:33,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:21:33,865 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 23:21:33,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:21:33,869 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 23:21:33,871 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 23:21:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:21:35,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 23:21:35,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:21:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2024-11-05 23:21:47,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:21:47,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:21:47,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955582152] [2024-11-05 23:21:47,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955582152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:21:47,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:21:47,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-05 23:21:47,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720013227] [2024-11-05 23:21:47,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:21:47,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 23:21:47,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:21:47,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 23:21:47,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 23:21:47,552 INFO L87 Difference]: Start difference. First operand 144 states and 234 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2024-11-05 23:21:52,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:21:56,786 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 23:22:01,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:22:06,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:22:10,620 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 23:22:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:22:10,862 INFO L93 Difference]: Finished difference Result 433 states and 703 transitions. [2024-11-05 23:22:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 23:22:10,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 304 [2024-11-05 23:22:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:22:10,869 INFO L225 Difference]: With dead ends: 433 [2024-11-05 23:22:10,869 INFO L226 Difference]: Without dead ends: 292 [2024-11-05 23:22:10,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-05 23:22:10,871 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 237 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 95 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2024-11-05 23:22:10,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 681 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 23.1s Time] [2024-11-05 23:22:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-05 23:22:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 282. [2024-11-05 23:22:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 185 states have (on average 1.4756756756756757) internal successors, (273), 185 states have internal predecessors, (273), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-05 23:22:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 461 transitions. [2024-11-05 23:22:10,938 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 461 transitions. Word has length 304 [2024-11-05 23:22:10,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:22:10,939 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 461 transitions. [2024-11-05 23:22:10,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2024-11-05 23:22:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 461 transitions. [2024-11-05 23:22:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-05 23:22:10,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:22:10,948 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] [2024-11-05 23:22:11,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 23:22:11,151 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 23:22:11,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:22:11,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:22:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2062261348, now seen corresponding path program 1 times [2024-11-05 23:22:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:22:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354266129] [2024-11-05 23:22:11,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:22:11,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 23:22:11,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:22:11,155 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 23:22:11,156 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 23:22:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:22:12,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 23:22:12,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:22:19,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 2188 proven. 75 refuted. 0 times theorem prover too weak. 2061 trivial. 0 not checked. [2024-11-05 23:22:19,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:22:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 63 proven. 75 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2024-11-05 23:22:28,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:22:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354266129] [2024-11-05 23:22:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354266129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 23:22:28,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 23:22:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 23:22:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746711729] [2024-11-05 23:22:28,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 23:22:28,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 23:22:28,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:22:28,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 23:22:28,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 23:22:28,461 INFO L87 Difference]: Start difference. First operand 282 states and 461 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73)