/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-35.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 19:53:54,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 19:53:54,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-23 19:53:54,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 19:53:54,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 19:53:54,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 19:53:54,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 19:53:54,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 19:53:54,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 19:53:54,907 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 19:53:54,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 19:53:54,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 19:53:54,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 19:53:54,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 19:53:54,910 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 19:53:54,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 19:53:54,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 19:53:54,911 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 19:53:54,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 19:53:54,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 19:53:54,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 19:53:54,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 19:53:54,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 19:53:54,913 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 19:53:54,913 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 19:53:54,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 19:53:54,913 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 19:53:54,914 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 19:53:54,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 19:53:54,914 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 19:53:54,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 19:53:54,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 19:53:54,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 19:53:54,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 19:53:54,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 19:53:54,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 19:53:54,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 19:53:54,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 19:53:54,917 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 19:53:54,917 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 19:53:54,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 19:53:54,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 19:53:54,918 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 19:53:54,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 19:53:54,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 19:53:54,919 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 19:53:54,919 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 [2023-12-23 19:53:55,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 19:53:55,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 19:53:55,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 19:53:55,192 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 19:53:55,192 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 19:53:55,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-35.i [2023-12-23 19:53:56,448 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 19:53:56,665 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 19:53:56,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-35.i [2023-12-23 19:53:56,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e522780df/7c3e91b034e848a9b8dff5f3b834638e/FLAGbf5ec4b31 [2023-12-23 19:53:56,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e522780df/7c3e91b034e848a9b8dff5f3b834638e [2023-12-23 19:53:56,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 19:53:56,696 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 19:53:56,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 19:53:56,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 19:53:56,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 19:53:56,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:53:56" (1/1) ... [2023-12-23 19:53:56,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ad4484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:56, skipping insertion in model container [2023-12-23 19:53:56,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:53:56" (1/1) ... [2023-12-23 19:53:56,739 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 19:53:56,884 WARN L239 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_floatingpointinfluence_no-floats_file-35.i[916,929] [2023-12-23 19:53:56,937 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 19:53:56,954 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 19:53:56,968 WARN L239 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_floatingpointinfluence_no-floats_file-35.i[916,929] [2023-12-23 19:53:56,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 19:53:57,016 INFO L206 MainTranslator]: Completed translation [2023-12-23 19:53:57,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57 WrapperNode [2023-12-23 19:53:57,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 19:53:57,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 19:53:57,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 19:53:57,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 19:53:57,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,065 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2023-12-23 19:53:57,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 19:53:57,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 19:53:57,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 19:53:57,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 19:53:57,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,096 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]. [2023-12-23 19:53:57,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 19:53:57,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 19:53:57,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 19:53:57,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 19:53:57,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (1/1) ... [2023-12-23 19:53:57,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 19:53:57,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 19:53:57,153 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) [2023-12-23 19:53:57,157 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 [2023-12-23 19:53:57,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 19:53:57,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 19:53:57,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 19:53:57,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 19:53:57,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 19:53:57,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 19:53:57,250 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 19:53:57,253 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 19:53:57,522 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 19:53:57,578 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 19:53:57,579 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 19:53:57,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:53:57 BoogieIcfgContainer [2023-12-23 19:53:57,579 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 19:53:57,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 19:53:57,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 19:53:57,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 19:53:57,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 07:53:56" (1/3) ... [2023-12-23 19:53:57,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3332ea79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:53:57, skipping insertion in model container [2023-12-23 19:53:57,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:53:57" (2/3) ... [2023-12-23 19:53:57,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3332ea79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:53:57, skipping insertion in model container [2023-12-23 19:53:57,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:53:57" (3/3) ... [2023-12-23 19:53:57,590 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-35.i [2023-12-23 19:53:57,603 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 19:53:57,604 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 19:53:57,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 19:53:57,642 INFO L357 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, mHoare=true, 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;@7ec21248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 19:53:57,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 19:53:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-23 19:53:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-23 19:53:57,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:53:57,657 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:53:57,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:53:57,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:53:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash -594923374, now seen corresponding path program 1 times [2023-12-23 19:53:57,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:53:57,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713807915] [2023-12-23 19:53:57,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:53:57,674 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 [2023-12-23 19:53:57,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:53:57,680 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) [2023-12-23 19:53:57,701 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 [2023-12-23 19:53:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:53:57,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 19:53:57,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:53:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2023-12-23 19:53:57,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:53:57,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:53:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713807915] [2023-12-23 19:53:57,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713807915] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:53:57,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:53:57,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 19:53:57,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017895647] [2023-12-23 19:53:57,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:53:57,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 19:53:57,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:53:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 19:53:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 19:53:57,932 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-23 19:53:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:53:57,990 INFO L93 Difference]: Finished difference Result 97 states and 174 transitions. [2023-12-23 19:53:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 19:53:57,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-23 19:53:57,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:53:58,002 INFO L225 Difference]: With dead ends: 97 [2023-12-23 19:53:58,003 INFO L226 Difference]: Without dead ends: 48 [2023-12-23 19:53:58,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 19:53:58,010 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-23 19:53:58,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-23 19:53:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-23 19:53:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-23 19:53:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-23 19:53:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2023-12-23 19:53:58,057 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 121 [2023-12-23 19:53:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:53:58,057 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2023-12-23 19:53:58,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-23 19:53:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2023-12-23 19:53:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-23 19:53:58,061 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:53:58,062 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:53:58,068 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 [2023-12-23 19:53:58,263 WARN L477 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 [2023-12-23 19:53:58,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:53:58,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:53:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash -553269102, now seen corresponding path program 1 times [2023-12-23 19:53:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:53:58,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639136385] [2023-12-23 19:53:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:53:58,267 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 [2023-12-23 19:53:58,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:53:58,269 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) [2023-12-23 19:53:58,270 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 [2023-12-23 19:53:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:53:58,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-23 19:53:58,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:53:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 327 proven. 15 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2023-12-23 19:53:58,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 19:53:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-23 19:53:58,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:53:58,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639136385] [2023-12-23 19:53:58,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639136385] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 19:53:58,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 19:53:58,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-23 19:53:58,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111864508] [2023-12-23 19:53:58,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 19:53:58,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-23 19:53:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:53:58,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-23 19:53:58,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-23 19:53:58,852 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-23 19:53:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:53:59,325 INFO L93 Difference]: Finished difference Result 153 states and 225 transitions. [2023-12-23 19:53:59,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-23 19:53:59,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 121 [2023-12-23 19:53:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:53:59,329 INFO L225 Difference]: With dead ends: 153 [2023-12-23 19:53:59,329 INFO L226 Difference]: Without dead ends: 106 [2023-12-23 19:53:59,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2023-12-23 19:53:59,331 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 110 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-23 19:53:59,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 185 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-23 19:53:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-23 19:53:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 54. [2023-12-23 19:53:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-23 19:53:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2023-12-23 19:53:59,350 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 121 [2023-12-23 19:53:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:53:59,351 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2023-12-23 19:53:59,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-23 19:53:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2023-12-23 19:53:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-23 19:53:59,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:53:59,353 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:53:59,364 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 [2023-12-23 19:53:59,561 WARN L477 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 [2023-12-23 19:53:59,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:53:59,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:53:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -551422060, now seen corresponding path program 1 times [2023-12-23 19:53:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:53:59,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024956765] [2023-12-23 19:53:59,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:53:59,564 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 [2023-12-23 19:53:59,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:53:59,565 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) [2023-12-23 19:53:59,572 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 [2023-12-23 19:53:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:53:59,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-23 19:53:59,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:54:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 327 proven. 15 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2023-12-23 19:54:14,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 19:56:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-23 19:56:23,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:56:23,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024956765] [2023-12-23 19:56:23,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024956765] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 19:56:23,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 19:56:23,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-12-23 19:56:23,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551727032] [2023-12-23 19:56:23,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 19:56:23,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-23 19:56:23,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:56:23,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-23 19:56:23,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-12-23 19:56:23,158 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-23 19:56:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:56:27,534 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2023-12-23 19:56:27,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-23 19:56:27,536 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 121 [2023-12-23 19:56:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:56:27,538 INFO L225 Difference]: With dead ends: 102 [2023-12-23 19:56:27,539 INFO L226 Difference]: Without dead ends: 100 [2023-12-23 19:56:27,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=314, Invalid=946, Unknown=0, NotChecked=0, Total=1260 [2023-12-23 19:56:27,541 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 182 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-23 19:56:27,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 219 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-23 19:56:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-23 19:56:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 61. [2023-12-23 19:56:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-23 19:56:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2023-12-23 19:56:27,553 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 121 [2023-12-23 19:56:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:56:27,553 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2023-12-23 19:56:27,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-23 19:56:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2023-12-23 19:56:27,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-23 19:56:27,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:56:27,556 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:56:27,567 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 [2023-12-23 19:56:27,761 WARN L477 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 [2023-12-23 19:56:27,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:56:27,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:56:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash -610527404, now seen corresponding path program 1 times [2023-12-23 19:56:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:56:27,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967501730] [2023-12-23 19:56:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:56:27,765 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 [2023-12-23 19:56:27,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:56:27,767 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) [2023-12-23 19:56:27,768 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 [2023-12-23 19:56:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:56:27,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-23 19:56:27,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:56:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 357 proven. 18 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2023-12-23 19:56:27,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 19:56:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-23 19:56:28,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:56:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967501730] [2023-12-23 19:56:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967501730] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 19:56:28,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 19:56:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-12-23 19:56:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115114045] [2023-12-23 19:56:28,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 19:56:28,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-23 19:56:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:56:28,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-23 19:56:28,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-23 19:56:28,043 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-23 19:56:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:56:28,375 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2023-12-23 19:56:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-23 19:56:28,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 121 [2023-12-23 19:56:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:56:28,379 INFO L225 Difference]: With dead ends: 188 [2023-12-23 19:56:28,380 INFO L226 Difference]: Without dead ends: 128 [2023-12-23 19:56:28,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2023-12-23 19:56:28,381 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 125 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-23 19:56:28,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 178 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-23 19:56:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-23 19:56:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 65. [2023-12-23 19:56:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-23 19:56:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2023-12-23 19:56:28,396 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 121 [2023-12-23 19:56:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:56:28,397 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2023-12-23 19:56:28,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-23 19:56:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2023-12-23 19:56:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-23 19:56:28,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:56:28,399 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:56:28,407 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 (5)] Forceful destruction successful, exit code 0 [2023-12-23 19:56:28,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 [2023-12-23 19:56:28,605 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:56:28,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:56:28,605 INFO L85 PathProgramCache]: Analyzing trace with hash 128636310, now seen corresponding path program 1 times [2023-12-23 19:56:28,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:56:28,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626296767] [2023-12-23 19:56:28,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:56:28,606 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 [2023-12-23 19:56:28,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:56:28,608 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2023-12-23 19:56:28,609 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 (6)] Waiting until timeout for monitored process [2023-12-23 19:56:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:56:28,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 19:56:28,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:56:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-23 19:56:28,695 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:56:28,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:56:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626296767] [2023-12-23 19:56:28,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626296767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:56:28,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:56:28,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 19:56:28,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239378191] [2023-12-23 19:56:28,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:56:28,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 19:56:28,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:56:28,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 19:56:28,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 19:56:28,698 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-23 19:56:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:56:28,730 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2023-12-23 19:56:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 19:56:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-23 19:56:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:56:28,733 INFO L225 Difference]: With dead ends: 124 [2023-12-23 19:56:28,733 INFO L226 Difference]: Without dead ends: 60 [2023-12-23 19:56:28,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 19:56:28,735 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-23 19:56:28,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-23 19:56:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-23 19:56:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-23 19:56:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-23 19:56:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2023-12-23 19:56:28,746 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 121 [2023-12-23 19:56:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:56:28,746 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2023-12-23 19:56:28,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-23 19:56:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2023-12-23 19:56:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-23 19:56:28,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:56:28,748 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:56:28,758 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 (6)] Forceful destruction successful, exit code 0 [2023-12-23 19:56:28,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 [2023-12-23 19:56:28,954 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:56:28,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:56:28,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1756186411, now seen corresponding path program 1 times [2023-12-23 19:56:28,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:56:28,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611424210] [2023-12-23 19:56:28,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:56:28,956 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 [2023-12-23 19:56:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:56:28,957 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2023-12-23 19:56:28,962 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 (7)] Waiting until timeout for monitored process [2023-12-23 19:56:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:56:29,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-23 19:56:29,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:57:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 515 proven. 138 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2023-12-23 19:57:01,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 19:59:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 78 proven. 33 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2023-12-23 19:59:00,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:59:00,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611424210] [2023-12-23 19:59:00,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611424210] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 19:59:00,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 19:59:00,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 15] total 46 [2023-12-23 19:59:00,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188422504] [2023-12-23 19:59:00,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 19:59:00,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-23 19:59:00,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:59:00,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-23 19:59:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=1652, Unknown=0, NotChecked=0, Total=2070 [2023-12-23 19:59:00,928 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 46 states, 46 states have (on average 1.673913043478261) internal successors, (77), 43 states have internal predecessors, (77), 11 states have call successors, (33), 9 states have call predecessors, (33), 13 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2023-12-23 19:59:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:59:15,469 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2023-12-23 19:59:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-23 19:59:15,471 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.673913043478261) internal successors, (77), 43 states have internal predecessors, (77), 11 states have call successors, (33), 9 states have call predecessors, (33), 13 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Word has length 122 [2023-12-23 19:59:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:59:15,472 INFO L225 Difference]: With dead ends: 105 [2023-12-23 19:59:15,472 INFO L226 Difference]: Without dead ends: 0 [2023-12-23 19:59:15,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1319, Invalid=4843, Unknown=0, NotChecked=0, Total=6162 [2023-12-23 19:59:15,475 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 142 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-23 19:59:15,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 265 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-23 19:59:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-23 19:59:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-23 19:59:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-23 19:59:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-23 19:59:15,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2023-12-23 19:59:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:59:15,477 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-23 19:59:15,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.673913043478261) internal successors, (77), 43 states have internal predecessors, (77), 11 states have call successors, (33), 9 states have call predecessors, (33), 13 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2023-12-23 19:59:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-23 19:59:15,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-23 19:59:15,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 19:59:15,488 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 (7)] Forceful destruction successful, exit code 0 [2023-12-23 19:59:15,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 [2023-12-23 19:59:15,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-23 19:59:16,593 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-12-23 19:59:16,593 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 64) no Hoare annotation was computed. [2023-12-23 19:59:16,593 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-23 19:59:16,593 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-23 19:59:16,593 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-23 19:59:16,593 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,593 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,594 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_12~0)) (.cse1 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse0 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse0 (_ bv4294967265 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsle .cse1 (_ bv31 32)))) [2023-12-23 19:59:16,594 INFO L895 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_12~0)) (.cse1 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse0 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse0 (_ bv4294967265 32)) (bvsge ((_ sign_extend 24) ~var_1_14~0) (_ bv4294967233 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsle .cse1 (_ bv31 32)))) [2023-12-23 19:59:16,594 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-12-23 19:59:16,594 INFO L895 garLoopResultBuilder]: At program point L111-2(lines 111 117) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (or (= ~var_1_1~0 (bvadd ~var_1_5~0 ~var_1_4~0)) (not (bvsge (bvmul ~var_1_5~0 ~var_1_1~0) ~var_1_4~0))) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,594 INFO L899 garLoopResultBuilder]: For program point L111-3(lines 111 117) no Hoare annotation was computed. [2023-12-23 19:59:16,594 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,594 INFO L895 garLoopResultBuilder]: At program point L95-1(line 95) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,594 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-12-23 19:59:16,595 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-12-23 19:59:16,595 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 40 68) no Hoare annotation was computed. [2023-12-23 19:59:16,595 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-23 19:59:16,595 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,595 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,595 INFO L899 garLoopResultBuilder]: For program point L96(line 96) no Hoare annotation was computed. [2023-12-23 19:59:16,595 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (not (= ~var_1_17~0 (_ bv0 8)))) [2023-12-23 19:59:16,595 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsge ((_ sign_extend 24) ~var_1_12~0) (_ bv4294967265 32)) (not (= ~var_1_17~0 (_ bv0 8)))) [2023-12-23 19:59:16,595 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-12-23 19:59:16,596 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,596 INFO L895 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,596 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 40 68) no Hoare annotation was computed. [2023-12-23 19:59:16,596 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-12-23 19:59:16,596 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 68) no Hoare annotation was computed. [2023-12-23 19:59:16,596 INFO L895 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,596 INFO L895 garLoopResultBuilder]: At program point L98-1(line 98) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,596 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-12-23 19:59:16,596 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-23 19:59:16,597 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,597 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,597 INFO L899 garLoopResultBuilder]: For program point L99(lines 69 100) no Hoare annotation was computed. [2023-12-23 19:59:16,597 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-23 19:59:16,597 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_12~0))) (and (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse0 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse0 (_ bv4294967265 32)))) [2023-12-23 19:59:16,597 INFO L895 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_12~0))) (and (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse0 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse0 (_ bv4294967265 32)) (bvsge ((_ sign_extend 24) ~var_1_13~0) (_ bv4294967265 32)))) [2023-12-23 19:59:16,597 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-23 19:59:16,597 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 44) no Hoare annotation was computed. [2023-12-23 19:59:16,597 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 42 44) no Hoare annotation was computed. [2023-12-23 19:59:16,597 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,597 INFO L895 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 24) ~var_1_12~0)) (.cse0 ((_ sign_extend 24) ~var_1_14~0)) (.cse2 ((_ sign_extend 24) ~var_1_13~0))) (and (bvsle .cse0 (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_16~0) (_ bv0 32)) (bvsle .cse1 (_ bv32 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv1 32)) (bvsge .cse1 (_ bv4294967265 32)) (bvsge .cse0 (_ bv4294967233 32)) (bvsge .cse2 (_ bv4294967265 32)) (bvsle .cse2 (_ bv31 32)))) [2023-12-23 19:59:16,598 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-12-23 19:59:16,598 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 40 68) no Hoare annotation was computed. [2023-12-23 19:59:16,598 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-23 19:59:16,598 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-23 19:59:16,598 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-23 19:59:16,598 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-23 19:59:16,601 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-23 19:59:16,602 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 19:59:16,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 07:59:16 BoogieIcfgContainer [2023-12-23 19:59:16,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 19:59:16,614 INFO L158 Benchmark]: Toolchain (without parser) took 319917.62ms. Allocated memory was 195.0MB in the beginning and 923.8MB in the end (delta: 728.8MB). Free memory was 142.4MB in the beginning and 640.7MB in the end (delta: -498.3MB). Peak memory consumption was 231.8MB. Max. memory is 8.0GB. [2023-12-23 19:59:16,614 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 195.0MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 19:59:16,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.17ms. Allocated memory is still 195.0MB. Free memory was 142.2MB in the beginning and 129.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-23 19:59:16,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory is still 195.0MB. Free memory was 129.1MB in the beginning and 127.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 19:59:16,615 INFO L158 Benchmark]: Boogie Preprocessor took 52.45ms. Allocated memory is still 195.0MB. Free memory was 127.0MB in the beginning and 124.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 19:59:16,615 INFO L158 Benchmark]: RCFGBuilder took 459.69ms. Allocated memory is still 195.0MB. Free memory was 124.1MB in the beginning and 158.0MB in the end (delta: -33.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2023-12-23 19:59:16,615 INFO L158 Benchmark]: TraceAbstraction took 319031.35ms. Allocated memory was 195.0MB in the beginning and 923.8MB in the end (delta: 728.8MB). Free memory was 157.5MB in the beginning and 640.7MB in the end (delta: -483.2MB). Peak memory consumption was 245.5MB. Max. memory is 8.0GB. [2023-12-23 19:59:16,618 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63ms. Allocated memory is still 195.0MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 318.17ms. Allocated memory is still 195.0MB. Free memory was 142.2MB in the beginning and 129.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory is still 195.0MB. Free memory was 129.1MB in the beginning and 127.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.45ms. Allocated memory is still 195.0MB. Free memory was 127.0MB in the beginning and 124.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 459.69ms. Allocated memory is still 195.0MB. Free memory was 124.1MB in the beginning and 158.0MB in the end (delta: -33.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * TraceAbstraction took 319031.35ms. Allocated memory was 195.0MB in the beginning and 923.8MB in the end (delta: 728.8MB). Free memory was 157.5MB in the beginning and 640.7MB in the end (delta: -483.2MB). Peak memory consumption was 245.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 319.0s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 620 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 570 mSDsluCounter, 1040 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 700 mSDsCounter, 304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1769 IncrementalHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 304 mSolverCounterUnsat, 340 mSDtfsCounter, 1769 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1275 GetRequests, 1126 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 24.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=4, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 154 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 121 PreInvPairs, 146 NumberOfFragments, 610 HoareAnnotationTreeSize, 121 FormulaSimplifications, 18177 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FormulaSimplificationsInter, 5908 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 296.0s InterpolantComputationTime, 727 NumberOfCodeBlocks, 727 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1202 ConstructedInterpolants, 1 QuantifiedInterpolants, 7874 SizeOfPredicates, 74 NumberOfNonLiveVariables, 1192 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 7333/7600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((var_1_14 <= 63) && (var_1_16 <= 0)) && (var_1_12 <= 32)) && (var_1_17 >= 1)) && (var_1_12 >= -31)) && (var_1_14 >= -63)) && (var_1_13 >= -31)) && ((var_1_1 == ((var_1_5 + var_1_4) % 4294967296)) || !(((var_1_5 * var_1_1) >= var_1_4)))) && (var_1_13 <= 31)) RESULT: Ultimate proved your program to be correct! [2023-12-23 19:59:16,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...