/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 FOX -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-28.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 08:21:12,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 08:21:12,421 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-06 08:21:12,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 08:21:12,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 08:21:12,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 08:21:12,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 08:21:12,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 08:21:12,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 08:21:12,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 08:21:12,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 08:21:12,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 08:21:12,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 08:21:12,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 08:21:12,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 08:21:12,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 08:21:12,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 08:21:12,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 08:21:12,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 08:21:12,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 08:21:12,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 08:21:12,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 08:21:12,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 08:21:12,468 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 08:21:12,468 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 08:21:12,469 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 08:21:12,469 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 08:21:12,469 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 08:21:12,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 08:21:12,470 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 08:21:12,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 08:21:12,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 08:21:12,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 08:21:12,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 08:21:12,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:21:12,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 08:21:12,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 08:21:12,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 08:21:12,473 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 08:21:12,473 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 08:21:12,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 08:21:12,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 08:21:12,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 08:21:12,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 08:21:12,475 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 -> FOX [2024-11-06 08:21:12,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 08:21:12,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 08:21:12,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 08:21:12,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 08:21:12,718 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 08:21:12,719 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-28.i [2024-11-06 08:21:14,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 08:21:14,391 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 08:21:14,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-28.i [2024-11-06 08:21:14,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1e5665c/007aa4d83a4e4ae6ae0eadc5ef52f19e/FLAGe8dea0f6f [2024-11-06 08:21:14,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1e5665c/007aa4d83a4e4ae6ae0eadc5ef52f19e [2024-11-06 08:21:14,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 08:21:14,418 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 08:21:14,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 08:21:14,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 08:21:14,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 08:21:14,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:14,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435f2931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14, skipping insertion in model container [2024-11-06 08:21:14,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:14,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 08:21:14,630 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-28.i[916,929] [2024-11-06 08:21:14,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:21:14,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 08:21:14,795 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-28.i[916,929] [2024-11-06 08:21:14,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:21:14,880 INFO L204 MainTranslator]: Completed translation [2024-11-06 08:21:14,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14 WrapperNode [2024-11-06 08:21:14,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 08:21:14,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 08:21:14,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 08:21:14,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 08:21:14,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:14,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:14,936 INFO L138 Inliner]: procedures = 27, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 337 [2024-11-06 08:21:14,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 08:21:14,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 08:21:14,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 08:21:14,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 08:21:14,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:14,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:14,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:14,983 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-06 08:21:14,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:14,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:15,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:15,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:15,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:15,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:15,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 08:21:15,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 08:21:15,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 08:21:15,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 08:21:15,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (1/1) ... [2024-11-06 08:21:15,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:21:15,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 08:21:15,084 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-06 08:21:15,090 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-06 08:21:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 08:21:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 08:21:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 08:21:15,116 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 08:21:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 08:21:15,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 08:21:15,268 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 08:21:15,270 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 08:21:21,972 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-06 08:21:21,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 08:21:21,994 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 08:21:21,994 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 08:21:21,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:21:21 BoogieIcfgContainer [2024-11-06 08:21:21,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 08:21:21,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 08:21:21,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 08:21:22,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 08:21:22,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:21:14" (1/3) ... [2024-11-06 08:21:22,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bdec92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:21:22, skipping insertion in model container [2024-11-06 08:21:22,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:21:14" (2/3) ... [2024-11-06 08:21:22,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bdec92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:21:22, skipping insertion in model container [2024-11-06 08:21:22,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:21:21" (3/3) ... [2024-11-06 08:21:22,003 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-28.i [2024-11-06 08:21:22,018 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 08:21:22,019 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 08:21:22,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 08:21:22,085 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;@380a1882, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 08:21:22,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 08:21:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-06 08:21:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-06 08:21:22,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:21:22,110 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:21:22,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:21:22,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:21:22,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1673006911, now seen corresponding path program 1 times [2024-11-06 08:21:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:21:22,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321048627] [2024-11-06 08:21:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:21:22,129 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-06 08:21:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:21:22,131 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-06 08:21:22,133 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-06 08:21:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:21:22,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 08:21:22,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:21:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2024-11-06 08:21:23,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:21:23,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:21:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321048627] [2024-11-06 08:21:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321048627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:21:23,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:21:23,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 08:21:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553960912] [2024-11-06 08:21:23,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:21:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 08:21:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:21:23,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 08:21:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 08:21:23,051 INFO L87 Difference]: Start difference. First operand has 144 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-06 08:21:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:21:23,107 INFO L93 Difference]: Finished difference Result 281 states and 507 transitions. [2024-11-06 08:21:23,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 08:21:23,109 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 287 [2024-11-06 08:21:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:21:23,117 INFO L225 Difference]: With dead ends: 281 [2024-11-06 08:21:23,118 INFO L226 Difference]: Without dead ends: 140 [2024-11-06 08:21:23,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 286 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-06 08:21:23,128 INFO L432 NwaCegarLoop]: 227 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, 227 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-06 08:21:23,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 08:21:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-06 08:21:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-06 08:21:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 95 states have internal predecessors, (141), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-06 08:21:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 227 transitions. [2024-11-06 08:21:23,185 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 227 transitions. Word has length 287 [2024-11-06 08:21:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:21:23,186 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 227 transitions. [2024-11-06 08:21:23,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-06 08:21:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 227 transitions. [2024-11-06 08:21:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-06 08:21:23,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:21:23,195 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:21:23,226 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-06 08:21:23,395 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-06 08:21:23,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:21:23,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:21:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash 100813819, now seen corresponding path program 1 times [2024-11-06 08:21:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:21:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601063001] [2024-11-06 08:21:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:21:23,399 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-06 08:21:23,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:21:23,403 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-06 08:21:23,404 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-06 08:21:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:21:24,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 08:21:24,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:21:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1342 proven. 96 refuted. 0 times theorem prover too weak. 2174 trivial. 0 not checked. [2024-11-06 08:21:27,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:21:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 30 proven. 96 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2024-11-06 08:21:30,461 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:21:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601063001] [2024-11-06 08:21:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601063001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:21:30,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:21:30,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-06 08:21:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605456746] [2024-11-06 08:21:30,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:21:30,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 08:21:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:21:30,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 08:21:30,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 08:21:30,470 INFO L87 Difference]: Start difference. First operand 140 states and 227 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2024-11-06 08:21:37,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:21:41,592 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-06 08:21:45,600 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-06 08:21:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:21:48,239 INFO L93 Difference]: Finished difference Result 373 states and 593 transitions. [2024-11-06 08:21:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 08:21:48,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 287 [2024-11-06 08:21:48,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:21:48,245 INFO L225 Difference]: With dead ends: 373 [2024-11-06 08:21:48,245 INFO L226 Difference]: Without dead ends: 236 [2024-11-06 08:21:48,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 566 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-06 08:21:48,247 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 459 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 139 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-06 08:21:48,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 620 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 543 Invalid, 3 Unknown, 0 Unchecked, 16.8s Time] [2024-11-06 08:21:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-06 08:21:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 142. [2024-11-06 08:21:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-06 08:21:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 221 transitions. [2024-11-06 08:21:48,279 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 221 transitions. Word has length 287 [2024-11-06 08:21:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:21:48,280 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 221 transitions. [2024-11-06 08:21:48,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2024-11-06 08:21:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 221 transitions. [2024-11-06 08:21:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-06 08:21:48,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:21:48,285 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:21:48,328 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-06 08:21:48,485 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-06 08:21:48,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:21:48,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:21:48,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1754687132, now seen corresponding path program 1 times [2024-11-06 08:21:48,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:21:48,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986686374] [2024-11-06 08:21:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:21:48,488 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-06 08:21:48,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:21:48,491 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-06 08:21:48,493 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-06 08:21:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:21:49,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 08:21:49,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:21:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1836 proven. 57 refuted. 0 times theorem prover too weak. 1719 trivial. 0 not checked. [2024-11-06 08:21:51,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:21:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 69 proven. 57 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2024-11-06 08:21:53,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:21:53,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986686374] [2024-11-06 08:21:53,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986686374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:21:53,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:21:53,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-06 08:21:53,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867926298] [2024-11-06 08:21:53,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:21:53,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 08:21:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:21:53,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 08:21:53,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-06 08:21:53,704 INFO L87 Difference]: Start difference. First operand 142 states and 221 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-06 08:22:00,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:22:04,136 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-06 08:22:08,139 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-06 08:22:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:22:08,143 INFO L93 Difference]: Finished difference Result 288 states and 444 transitions. [2024-11-06 08:22:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 08:22:08,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 288 [2024-11-06 08:22:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:22:08,223 INFO L225 Difference]: With dead ends: 288 [2024-11-06 08:22:08,223 INFO L226 Difference]: Without dead ends: 149 [2024-11-06 08:22:08,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 568 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-06 08:22:08,225 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 327 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 109 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-06 08:22:08,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 396 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 229 Invalid, 3 Unknown, 0 Unchecked, 14.2s Time] [2024-11-06 08:22:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-06 08:22:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2024-11-06 08:22:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-06 08:22:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 219 transitions. [2024-11-06 08:22:08,245 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 219 transitions. Word has length 288 [2024-11-06 08:22:08,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:22:08,247 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 219 transitions. [2024-11-06 08:22:08,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-06 08:22:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-06 08:22:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-06 08:22:08,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:22:08,252 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:22:08,294 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-06 08:22:08,452 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-06 08:22:08,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:22:08,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:22:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1154141629, now seen corresponding path program 1 times [2024-11-06 08:22:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:22:08,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561084990] [2024-11-06 08:22:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:22:08,455 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-06 08:22:08,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:22:08,459 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-06 08:22:08,460 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-06 08:22:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:22:09,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 08:22:09,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:22:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1848 proven. 63 refuted. 0 times theorem prover too weak. 1701 trivial. 0 not checked. [2024-11-06 08:22:22,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:22:25,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:22:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561084990] [2024-11-06 08:22:25,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561084990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 08:22:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102814985] [2024-11-06 08:22:25,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:22:25,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 08:22:25,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 08:22:25,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 08:22:25,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 08:22:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:22:25,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 08:22:25,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:22:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2394 proven. 204 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2024-11-06 08:22:35,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:22:37,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102814985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 08:22:37,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:22:37,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 16 [2024-11-06 08:22:37,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870835963] [2024-11-06 08:22:37,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:22:37,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-06 08:22:37,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:22:37,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-06 08:22:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-11-06 08:22:37,373 INFO L87 Difference]: Start difference. First operand 145 states and 219 transitions. Second operand has 16 states, 16 states have (on average 9.4375) internal successors, (151), 15 states have internal predecessors, (151), 6 states have call successors, (86), 6 states have call predecessors, (86), 9 states have return successors, (86), 6 states have call predecessors, (86), 6 states have call successors, (86)