/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/nla-digbench-scaling/egcd3-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 02:02:10,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 02:02:10,797 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-25 02:02:10,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 02:02:10,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 02:02:10,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 02:02:10,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 02:02:10,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 02:02:10,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 02:02:10,839 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 02:02:10,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 02:02:10,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 02:02:10,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 02:02:10,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 02:02:10,842 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 02:02:10,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 02:02:10,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 02:02:10,843 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 02:02:10,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 02:02:10,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 02:02:10,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 02:02:10,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 02:02:10,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 02:02:10,844 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 02:02:10,844 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 02:02:10,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 02:02:10,845 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 02:02:10,845 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 02:02:10,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 02:02:10,845 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 02:02:10,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 02:02:10,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 02:02:10,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 02:02:10,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 02:02:10,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:02:10,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 02:02:10,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 02:02:10,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 02:02:10,847 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 02:02:10,848 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 02:02:10,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 02:02:10,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 02:02:10,848 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 02:02:10,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 02:02:10,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 02:02:10,849 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 02:02:10,849 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-25 02:02:11,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 02:02:11,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 02:02:11,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 02:02:11,171 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 02:02:11,172 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 02:02:11,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound50.c [2023-12-25 02:02:12,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 02:02:12,505 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 02:02:12,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound50.c [2023-12-25 02:02:12,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0345c1c/bdb357e5744a4ef287bd39e6ccf46e00/FLAGafbc42156 [2023-12-25 02:02:12,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0345c1c/bdb357e5744a4ef287bd39e6ccf46e00 [2023-12-25 02:02:12,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 02:02:12,529 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 02:02:12,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 02:02:12,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 02:02:12,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 02:02:12,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3039b80e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12, skipping insertion in model container [2023-12-25 02:02:12,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,554 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 02:02:12,668 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound50.c[490,503] [2023-12-25 02:02:12,687 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:02:12,705 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 02:02:12,715 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound50.c[490,503] [2023-12-25 02:02:12,724 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:02:12,738 INFO L206 MainTranslator]: Completed translation [2023-12-25 02:02:12,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12 WrapperNode [2023-12-25 02:02:12,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 02:02:12,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 02:02:12,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 02:02:12,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 02:02:12,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,774 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-12-25 02:02:12,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 02:02:12,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 02:02:12,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 02:02:12,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 02:02:12,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,801 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-25 02:02:12,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 02:02:12,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 02:02:12,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 02:02:12,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 02:02:12,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (1/1) ... [2023-12-25 02:02:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:02:12,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 02:02:12,846 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-25 02:02:12,869 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-25 02:02:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 02:02:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 02:02:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 02:02:12,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 02:02:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 02:02:12,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 02:02:12,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 02:02:12,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 02:02:12,942 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 02:02:12,944 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 02:02:13,292 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 02:02:13,321 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 02:02:13,321 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-25 02:02:13,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:02:13 BoogieIcfgContainer [2023-12-25 02:02:13,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 02:02:13,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 02:02:13,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 02:02:13,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 02:02:13,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 02:02:12" (1/3) ... [2023-12-25 02:02:13,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fdd086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:02:13, skipping insertion in model container [2023-12-25 02:02:13,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:02:12" (2/3) ... [2023-12-25 02:02:13,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fdd086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:02:13, skipping insertion in model container [2023-12-25 02:02:13,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:02:13" (3/3) ... [2023-12-25 02:02:13,331 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound50.c [2023-12-25 02:02:13,345 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 02:02:13,345 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 02:02:13,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 02:02:13,399 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;@52dc0741, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 02:02:13,399 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 02:02:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 02:02:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 02:02:13,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:02:13,414 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:02:13,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:02:13,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:02:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash 67099435, now seen corresponding path program 1 times [2023-12-25 02:02:13,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:02:13,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472180141] [2023-12-25 02:02:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:02:13,431 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-25 02:02:13,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:02:13,436 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-25 02:02:13,447 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-25 02:02:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:02:13,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 02:02:13,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:02:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:02:13,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:02:13,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:02:13,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472180141] [2023-12-25 02:02:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472180141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:02:13,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:02:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 02:02:13,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969837872] [2023-12-25 02:02:13,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:02:13,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 02:02:13,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:02:13,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 02:02:13,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 02:02:13,746 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:02:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:02:13,787 INFO L93 Difference]: Finished difference Result 62 states and 104 transitions. [2023-12-25 02:02:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 02:02:13,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-25 02:02:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:02:13,795 INFO L225 Difference]: With dead ends: 62 [2023-12-25 02:02:13,796 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 02:02:13,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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-25 02:02:13,804 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 02:02:13,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 02:02:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 02:02:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-25 02:02:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 02:02:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-12-25 02:02:13,849 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 28 [2023-12-25 02:02:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:02:13,850 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-12-25 02:02:13,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:02:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-12-25 02:02:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 02:02:13,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:02:13,853 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:02:13,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 02:02:14,062 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-25 02:02:14,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:02:14,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:02:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1772608446, now seen corresponding path program 1 times [2023-12-25 02:02:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:02:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520764408] [2023-12-25 02:02:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:02:14,064 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-25 02:02:14,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:02:14,066 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-25 02:02:14,068 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-25 02:02:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:02:14,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 02:02:14,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:02:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:02:14,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:02:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 02:02:14,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:02:14,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520764408] [2023-12-25 02:02:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520764408] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:02:14,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:02:14,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2023-12-25 02:02:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703234529] [2023-12-25 02:02:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:02:14,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 02:02:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:02:14,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 02:02:14,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 02:02:14,732 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:02:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:02:15,343 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-12-25 02:02:15,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:02:15,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2023-12-25 02:02:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:02:15,351 INFO L225 Difference]: With dead ends: 39 [2023-12-25 02:02:15,351 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 02:02:15,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 02:02:15,353 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 02:02:15,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 02:02:15,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 02:02:15,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-25 02:02:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 02:02:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-25 02:02:15,362 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 29 [2023-12-25 02:02:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:02:15,363 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-25 02:02:15,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:02:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-25 02:02:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 02:02:15,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:02:15,364 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:02:15,376 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-25 02:02:15,573 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-25 02:02:15,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:02:15,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:02:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1072684582, now seen corresponding path program 1 times [2023-12-25 02:02:15,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:02:15,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360173402] [2023-12-25 02:02:15,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:02:15,575 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-25 02:02:15,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:02:15,577 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-25 02:02:15,599 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-25 02:02:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:02:15,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 02:02:15,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:02:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:02:16,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:02:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:02:21,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:02:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360173402] [2023-12-25 02:02:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360173402] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:02:21,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:02:21,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 02:02:21,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240506272] [2023-12-25 02:02:21,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:02:21,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:02:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:02:21,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:02:21,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:02:21,455 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:02:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:02:26,205 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-12-25 02:02:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:02:26,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-12-25 02:02:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:02:26,231 INFO L225 Difference]: With dead ends: 48 [2023-12-25 02:02:26,232 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 02:02:26,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:02:26,233 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-25 02:02:26,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-25 02:02:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 02:02:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-12-25 02:02:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 02:02:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2023-12-25 02:02:26,246 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 32 [2023-12-25 02:02:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:02:26,246 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2023-12-25 02:02:26,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:02:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2023-12-25 02:02:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 02:02:26,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:02:26,248 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:02:26,256 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-25 02:02:26,453 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-25 02:02:26,456 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:02:26,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:02:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash 581538888, now seen corresponding path program 1 times [2023-12-25 02:02:26,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:02:26,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285849913] [2023-12-25 02:02:26,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:02:26,458 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-25 02:02:26,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:02:26,461 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-25 02:02:26,463 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-25 02:02:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:02:26,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 02:02:26,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:02:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:02:27,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:02:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 02:02:28,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:02:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285849913] [2023-12-25 02:02:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285849913] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:02:28,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:02:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-12-25 02:02:28,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334852798] [2023-12-25 02:02:28,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:02:28,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 02:02:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:02:28,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 02:02:28,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:02:28,186 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 02:02:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:02:33,441 INFO L93 Difference]: Finished difference Result 113 states and 161 transitions. [2023-12-25 02:02:33,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 02:02:33,449 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2023-12-25 02:02:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:02:33,451 INFO L225 Difference]: With dead ends: 113 [2023-12-25 02:02:33,451 INFO L226 Difference]: Without dead ends: 106 [2023-12-25 02:02:33,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2023-12-25 02:02:33,452 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 226 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-25 02:02:33,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 269 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-25 02:02:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-25 02:02:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 52. [2023-12-25 02:02:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 02:02:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2023-12-25 02:02:33,473 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 34 [2023-12-25 02:02:33,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:02:33,474 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2023-12-25 02:02:33,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 02:02:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2023-12-25 02:02:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 02:02:33,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:02:33,475 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 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-25 02:02:33,484 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-25 02:02:33,676 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-25 02:02:33,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:02:33,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:02:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1534715754, now seen corresponding path program 1 times [2023-12-25 02:02:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:02:33,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841537730] [2023-12-25 02:02:33,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:02:33,678 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-25 02:02:33,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:02:33,679 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-25 02:02:33,682 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-25 02:02:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:02:33,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 02:02:33,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:02:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:02:34,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:02:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:02:41,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:02:41,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841537730] [2023-12-25 02:02:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841537730] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:02:41,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:02:41,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 02:02:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993037129] [2023-12-25 02:02:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:02:41,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:02:41,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:02:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:02:41,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:02:41,530 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 02:02:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:02:47,932 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2023-12-25 02:02:47,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:02:47,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-12-25 02:02:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:02:47,968 INFO L225 Difference]: With dead ends: 60 [2023-12-25 02:02:47,968 INFO L226 Difference]: Without dead ends: 58 [2023-12-25 02:02:47,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:02:47,969 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-12-25 02:02:47,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-12-25 02:02:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-25 02:02:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2023-12-25 02:02:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 02:02:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2023-12-25 02:02:47,986 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 37 [2023-12-25 02:02:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:02:47,986 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2023-12-25 02:02:47,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 02:02:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2023-12-25 02:02:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 02:02:47,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:02:47,989 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:02:48,000 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-25 02:02:48,192 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-25 02:02:48,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:02:48,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:02:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1190433772, now seen corresponding path program 1 times [2023-12-25 02:02:48,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:02:48,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476389966] [2023-12-25 02:02:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:02:48,193 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-25 02:02:48,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:02:48,195 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-25 02:02:48,195 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-25 02:02:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:02:48,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 02:02:48,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:02:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:02:49,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:03:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:03:03,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:03:03,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476389966] [2023-12-25 02:03:03,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476389966] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:03:03,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:03:03,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2023-12-25 02:03:03,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821487030] [2023-12-25 02:03:03,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:03:03,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 02:03:03,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:03:03,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 02:03:03,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:03:03,196 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 02:03:14,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:03:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:03:23,440 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2023-12-25 02:03:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 02:03:23,469 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 37 [2023-12-25 02:03:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:03:23,470 INFO L225 Difference]: With dead ends: 82 [2023-12-25 02:03:23,470 INFO L226 Difference]: Without dead ends: 80 [2023-12-25 02:03:23,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-25 02:03:23,471 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 71 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2023-12-25 02:03:23,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 323 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 15.8s Time] [2023-12-25 02:03:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-25 02:03:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2023-12-25 02:03:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 02:03:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2023-12-25 02:03:23,489 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 37 [2023-12-25 02:03:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:03:23,489 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2023-12-25 02:03:23,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 02:03:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2023-12-25 02:03:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 02:03:23,491 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:03:23,491 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 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-25 02:03:23,505 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-25 02:03:23,705 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-25 02:03:23,706 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:03:23,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:03:23,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1246105370, now seen corresponding path program 1 times [2023-12-25 02:03:23,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:03:23,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338467077] [2023-12-25 02:03:23,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:03:23,706 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-25 02:03:23,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:03:23,707 INFO L229 MonitoredProcess]: Starting monitored process 8 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-25 02:03:23,708 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 (8)] Waiting until timeout for monitored process [2023-12-25 02:03:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:03:23,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 02:03:23,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:03:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 02:03:25,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:03:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 02:03:29,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:03:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338467077] [2023-12-25 02:03:29,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338467077] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:03:29,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:03:29,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-25 02:03:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878686931] [2023-12-25 02:03:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:03:29,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:03:29,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:03:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:03:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:03:29,597 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 02:03:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:03:36,008 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2023-12-25 02:03:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:03:36,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2023-12-25 02:03:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:03:36,024 INFO L225 Difference]: With dead ends: 104 [2023-12-25 02:03:36,024 INFO L226 Difference]: Without dead ends: 102 [2023-12-25 02:03:36,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:03:36,025 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-25 02:03:36,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-12-25 02:03:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-25 02:03:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2023-12-25 02:03:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-25 02:03:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2023-12-25 02:03:36,054 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 42 [2023-12-25 02:03:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:03:36,055 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2023-12-25 02:03:36,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 02:03:36,055 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2023-12-25 02:03:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 02:03:36,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:03:36,056 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:03:36,067 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 (8)] Forceful destruction successful, exit code 0 [2023-12-25 02:03:36,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-25 02:03:36,266 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:03:36,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:03:36,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1174265188, now seen corresponding path program 1 times [2023-12-25 02:03:36,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:03:36,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55831224] [2023-12-25 02:03:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:03:36,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-25 02:03:36,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:03:36,269 INFO L229 MonitoredProcess]: Starting monitored process 9 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-25 02:03:36,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 (9)] Waiting until timeout for monitored process [2023-12-25 02:03:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:03:36,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 02:03:36,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:03:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 02:03:38,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:04:31,985 WARN L293 SmtUtils]: Spent 6.20s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:04:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:04:43,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:04:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55831224] [2023-12-25 02:04:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55831224] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:04:43,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:04:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2023-12-25 02:04:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981367668] [2023-12-25 02:04:43,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:04:43,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 02:04:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:04:43,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 02:04:43,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=198, Unknown=1, NotChecked=0, Total=240 [2023-12-25 02:04:43,732 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 02:04:45,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:51,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:53,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:57,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:16,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:06:02,902 WARN L293 SmtUtils]: Spent 18.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:06:38,499 WARN L293 SmtUtils]: Spent 11.56s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:06:40,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:06:41,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:06:43,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:06:57,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:01,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:03,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:04,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:10,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:16,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:20,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:22,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:25,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:29,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:31,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:34,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:07:36,871 INFO L93 Difference]: Finished difference Result 203 states and 285 transitions. [2023-12-25 02:07:36,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 02:07:36,893 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2023-12-25 02:07:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:07:36,895 INFO L225 Difference]: With dead ends: 203 [2023-12-25 02:07:36,895 INFO L226 Difference]: Without dead ends: 201 [2023-12-25 02:07:36,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 143.5s TimeCoverageRelationStatistics Valid=138, Invalid=563, Unknown=1, NotChecked=0, Total=702 [2023-12-25 02:07:36,897 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 250 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 129 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.2s IncrementalHoareTripleChecker+Time [2023-12-25 02:07:36,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 260 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 330 Invalid, 4 Unknown, 0 Unchecked, 78.2s Time] [2023-12-25 02:07:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-25 02:07:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2023-12-25 02:07:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 120 states have (on average 1.2666666666666666) internal successors, (152), 121 states have internal predecessors, (152), 61 states have call successors, (61), 9 states have call predecessors, (61), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-25 02:07:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2023-12-25 02:07:36,969 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 42 [2023-12-25 02:07:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:07:36,970 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2023-12-25 02:07:36,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 13 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 02:07:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2023-12-25 02:07:36,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 02:07:36,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:07:36,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 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-25 02:07:36,987 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 02:07:37,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-25 02:07:37,188 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:07:37,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:07:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash 225223382, now seen corresponding path program 1 times [2023-12-25 02:07:37,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:07:37,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311474746] [2023-12-25 02:07:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:07:37,189 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-25 02:07:37,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:07:37,190 INFO L229 MonitoredProcess]: Starting monitored process 10 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-25 02:07:37,191 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 (10)] Waiting until timeout for monitored process [2023-12-25 02:07:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:07:37,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 02:07:37,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:07:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 02:07:38,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:07:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 02:07:43,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:07:43,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311474746] [2023-12-25 02:07:43,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311474746] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:07:43,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:07:43,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 02:07:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899440576] [2023-12-25 02:07:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:07:43,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:07:43,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:07:43,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:07:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:07:43,303 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 02:07:51,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:07:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:07:53,366 INFO L93 Difference]: Finished difference Result 288 states and 439 transitions. [2023-12-25 02:07:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:07:53,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2023-12-25 02:07:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:07:53,386 INFO L225 Difference]: With dead ends: 288 [2023-12-25 02:07:53,386 INFO L226 Difference]: Without dead ends: 286 [2023-12-25 02:07:53,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:07:53,387 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-12-25 02:07:53,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2023-12-25 02:07:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-25 02:07:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 265. [2023-12-25 02:07:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 137 states have (on average 1.2335766423357664) internal successors, (169), 152 states have internal predecessors, (169), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (116), 102 states have call predecessors, (116), 116 states have call successors, (116) [2023-12-25 02:07:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2023-12-25 02:07:53,492 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 47 [2023-12-25 02:07:53,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:07:53,492 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2023-12-25 02:07:53,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 02:07:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2023-12-25 02:07:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 02:07:53,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:07:53,499 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 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-25 02:07:53,514 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 02:07:53,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-25 02:07:53,714 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:07:53,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:07:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash 371933676, now seen corresponding path program 1 times [2023-12-25 02:07:53,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:07:53,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555901302] [2023-12-25 02:07:53,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:07:53,715 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-25 02:07:53,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:07:53,717 INFO L229 MonitoredProcess]: Starting monitored process 11 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-25 02:07:53,720 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 (11)] Waiting until timeout for monitored process [2023-12-25 02:07:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:07:54,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-25 02:07:54,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:08:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-25 02:08:01,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:08:51,486 WARN L293 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:41,210 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:09:53,730 WARN L293 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:09,123 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:13,268 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2))))) is different from false [2023-12-25 02:10:17,430 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2))))) is different from true [2023-12-25 02:10:28,245 WARN L293 SmtUtils]: Spent 7.56s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:36,456 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:12,440 WARN L293 SmtUtils]: Spent 14.27s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:12:19,743 WARN L293 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:31,205 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:38,999 WARN L293 SmtUtils]: Spent 7.79s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:43,162 WARN L854 $PredicateComparison]: unable to prove that (or (bvsge |c_ULTIMATE.start_main_~c~0#1| (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~v~0#1|)) (not (= |c_ULTIMATE.start_main_~v~0#1| (bvmul |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2))))) is different from false [2023-12-25 02:12:47,295 WARN L876 $PredicateComparison]: unable to prove that (or (bvsge |c_ULTIMATE.start_main_~c~0#1| (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~v~0#1|)) (not (= |c_ULTIMATE.start_main_~v~0#1| (bvmul |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2))))) is different from true [2023-12-25 02:12:59,790 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:10,300 WARN L293 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:14,493 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_~p~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23| (_ BitVec 64)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| (_ BitVec 32))) (or (= (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|)) (.cse2 (bvadd |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_10|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_43|))) (bvadd (bvmul |v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| .cse0) (bvmul |v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| .cse1) (bvneg (bvmul .cse1 (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~s~0#1_BEFORE_CALL_12| .cse2)) |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_8|))) (bvneg (bvmul (bvadd |v_ULTIMATE.start_main_~p~0#1_BEFORE_CALL_8| (bvneg (bvmul |v_ULTIMATE.start_main_~q~0#1_BEFORE_CALL_12| .cse2))) .cse0)))) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23|) (bvsge (bvmul (_ bv18446744073709551615 64) (bvneg |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|)) (bvmul (_ bv2 64) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|)) (= (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_23|) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_12|))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 02:13:24,968 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:33,507 WARN L293 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:13:51,512 WARN L293 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:02,461 WARN L293 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:12,180 WARN L293 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:18,965 WARN L293 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:27,245 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:35,371 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:41,635 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:49,407 WARN L293 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:14:57,123 WARN L293 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:05,666 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:14,191 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:22,875 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:31,291 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:39,936 WARN L293 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:45,095 WARN L293 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:15:50,740 WARN L293 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:16:02,813 WARN L854 $PredicateComparison]: unable to prove that (or (= (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 (bvadd (_ bv1 64) |c_ULTIMATE.start_main_~k~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)))) |c_ULTIMATE.start_main_~b~0#1|) (bvsge |c_ULTIMATE.start_main_~c~0#1| (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~b~0#1|)) (not (= (bvadd (bvneg |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~c~0#1|) (_ bv0 64)))) is different from false [2023-12-25 02:16:06,959 WARN L876 $PredicateComparison]: unable to prove that (or (= (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 (bvadd (_ bv1 64) |c_ULTIMATE.start_main_~k~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)))) |c_ULTIMATE.start_main_~b~0#1|) (bvsge |c_ULTIMATE.start_main_~c~0#1| (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~b~0#1|)) (not (= (bvadd (bvneg |c_ULTIMATE.start_main_~b~0#1|) |c_ULTIMATE.start_main_~c~0#1|) (_ bv0 64)))) is different from true [2023-12-25 02:16:15,655 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-25 02:16:51,769 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:16:51,769 WARN L340 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 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:16:52,800 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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 02:16:52,971 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 02:16:53,001 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 137 [2023-12-25 02:16:53,003 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 02:16:53,004 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 60 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-25 02:16:53,008 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:16:53,010 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 02:16:53,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 02:16:53 BoogieIcfgContainer [2023-12-25 02:16:53,012 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 02:16:53,012 INFO L158 Benchmark]: Toolchain (without parser) took 880483.68ms. Allocated memory was 198.2MB in the beginning and 290.5MB in the end (delta: 92.3MB). Free memory was 145.1MB in the beginning and 212.1MB in the end (delta: -67.0MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. [2023-12-25 02:16:53,012 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 198.2MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:16:53,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.66ms. Allocated memory is still 198.2MB. Free memory was 145.1MB in the beginning and 133.2MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 02:16:53,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.84ms. Allocated memory is still 198.2MB. Free memory was 133.2MB in the beginning and 131.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:16:53,013 INFO L158 Benchmark]: Boogie Preprocessor took 39.62ms. Allocated memory is still 198.2MB. Free memory was 131.5MB in the beginning and 129.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:16:53,013 INFO L158 Benchmark]: RCFGBuilder took 505.88ms. Allocated memory is still 198.2MB. Free memory was 129.4MB in the beginning and 115.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 02:16:53,014 INFO L158 Benchmark]: TraceAbstraction took 879687.32ms. Allocated memory was 198.2MB in the beginning and 290.5MB in the end (delta: 92.3MB). Free memory was 115.2MB in the beginning and 212.1MB in the end (delta: -96.9MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:16:53,015 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.16ms. Allocated memory is still 198.2MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.66ms. Allocated memory is still 198.2MB. Free memory was 145.1MB in the beginning and 133.2MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.84ms. Allocated memory is still 198.2MB. Free memory was 133.2MB in the beginning and 131.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.62ms. Allocated memory is still 198.2MB. Free memory was 131.5MB in the beginning and 129.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 505.88ms. Allocated memory is still 198.2MB. Free memory was 129.4MB in the beginning and 115.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 879687.32ms. Allocated memory was 198.2MB in the beginning and 290.5MB in the end (delta: 92.3MB). Free memory was 115.2MB in the beginning and 212.1MB in the end (delta: -96.9MB). There was no memory consumed. 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 - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was analyzing trace of length 60 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 879.6s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 227.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 621 SdHoareTripleChecker+Valid, 125.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 599 mSDsluCounter, 1459 SdHoareTripleChecker+Invalid, 115.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1151 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 888 IncrementalHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 308 mSDtfsCounter, 888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 173.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=9, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 94 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 109.5s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 611 ConstructedInterpolants, 26 QuantifiedInterpolants, 2912 SizeOfPredicates, 30 NumberOfNonLiveVariables, 621 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 387/488 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown