/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/bresenham-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:45:12,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:45:12,599 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 00:45:12,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:45:12,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:45:12,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:45:12,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:45:12,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:45:12,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:45:12,630 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:45:12,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:45:12,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:45:12,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:45:12,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:45:12,631 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:45:12,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:45:12,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:45:12,633 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:45:12,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:45:12,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:45:12,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:45:12,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:45:12,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:45:12,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:45:12,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:45:12,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:45:12,641 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:45:12,641 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:45:12,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:45:12,642 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:45:12,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:45:12,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:45:12,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:45:12,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:45:12,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:45:12,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:45:12,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:45:12,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:45:12,643 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:45:12,644 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:45:12,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:45:12,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:45:12,645 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:45:12,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:45:12,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:45:12,645 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:45:12,645 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 00:45:12,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:45:12,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:45:12,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:45:12,880 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:45:12,881 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:45:12,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound5.c [2023-12-25 00:45:14,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:45:14,255 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:45:14,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound5.c [2023-12-25 00:45:14,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1107c4d09/9822113eaaad4bd59e415a8e6b4fca04/FLAG3541f7f4a [2023-12-25 00:45:14,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1107c4d09/9822113eaaad4bd59e415a8e6b4fca04 [2023-12-25 00:45:14,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:45:14,276 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:45:14,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:45:14,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:45:14,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:45:14,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2515d75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14, skipping insertion in model container [2023-12-25 00:45:14,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,303 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:45:14,419 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/bresenham-ll_valuebound5.c[597,610] [2023-12-25 00:45:14,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:45:14,450 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:45:14,460 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/bresenham-ll_valuebound5.c[597,610] [2023-12-25 00:45:14,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:45:14,484 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:45:14,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14 WrapperNode [2023-12-25 00:45:14,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:45:14,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:45:14,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:45:14,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:45:14,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,523 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2023-12-25 00:45:14,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:45:14,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:45:14,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:45:14,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:45:14,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,543 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 00:45:14,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:45:14,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:45:14,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:45:14,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:45:14,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (1/1) ... [2023-12-25 00:45:14,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:45:14,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:45:14,592 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 00:45:14,618 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 00:45:14,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:45:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:45:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 00:45:14,625 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 00:45:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:45:14,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:45:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:45:14,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:45:14,683 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:45:14,684 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:45:15,086 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:45:15,114 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:45:15,114 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 00:45:15,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:45:15 BoogieIcfgContainer [2023-12-25 00:45:15,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:45:15,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:45:15,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:45:15,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:45:15,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:45:14" (1/3) ... [2023-12-25 00:45:15,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f25578d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:45:15, skipping insertion in model container [2023-12-25 00:45:15,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:45:14" (2/3) ... [2023-12-25 00:45:15,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f25578d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:45:15, skipping insertion in model container [2023-12-25 00:45:15,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:45:15" (3/3) ... [2023-12-25 00:45:15,129 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound5.c [2023-12-25 00:45:15,146 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:45:15,148 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:45:15,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:45:15,212 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;@1e38995, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:45:15,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:45:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:45:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 00:45:15,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:45:15,229 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:45:15,229 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:45:15,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:45:15,236 INFO L85 PathProgramCache]: Analyzing trace with hash 866122637, now seen corresponding path program 1 times [2023-12-25 00:45:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:45:15,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779783749] [2023-12-25 00:45:15,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:45:15,248 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 00:45:15,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:45:15,250 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 00:45:15,277 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 00:45:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:45:15,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:45:15,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:45:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 00:45:15,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:45:15,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:45:15,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779783749] [2023-12-25 00:45:15,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779783749] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:45:15,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:45:15,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:45:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78033275] [2023-12-25 00:45:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:45:15,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:45:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:45:15,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:45:15,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:45:15,470 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:45:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:45:15,492 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2023-12-25 00:45:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:45:15,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-25 00:45:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:45:15,503 INFO L225 Difference]: With dead ends: 46 [2023-12-25 00:45:15,503 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 00:45:15,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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 00:45:15,509 INFO L413 NwaCegarLoop]: 25 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, 25 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 00:45:15,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:45:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 00:45:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-25 00:45:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 00:45:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-12-25 00:45:15,535 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2023-12-25 00:45:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:45:15,535 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-12-25 00:45:15,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:45:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-12-25 00:45:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 00:45:15,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:45:15,537 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:45:15,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 00:45:15,750 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 00:45:15,751 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:45:15,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:45:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash 266317329, now seen corresponding path program 1 times [2023-12-25 00:45:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:45:15,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440718600] [2023-12-25 00:45:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:45:15,753 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 00:45:15,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:45:15,754 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 00:45:15,755 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 00:45:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:45:15,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 00:45:15,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:45:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:45:16,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:45:16,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:45:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440718600] [2023-12-25 00:45:16,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440718600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:45:16,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:45:16,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 00:45:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752765106] [2023-12-25 00:45:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:45:16,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 00:45:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:45:16,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 00:45:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 00:45:16,506 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:45:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:45:17,188 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-12-25 00:45:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 00:45:17,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-25 00:45:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:45:17,192 INFO L225 Difference]: With dead ends: 38 [2023-12-25 00:45:17,192 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 00:45:17,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-25 00:45:17,194 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 00:45:17,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 55 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 00:45:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 00:45:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-12-25 00:45:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:45:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-25 00:45:17,207 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2023-12-25 00:45:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:45:17,208 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-25 00:45:17,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:45:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-25 00:45:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 00:45:17,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:45:17,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:45:17,217 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 00:45:17,417 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 00:45:17,418 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:45:17,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:45:17,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1056709002, now seen corresponding path program 1 times [2023-12-25 00:45:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:45:17,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232432319] [2023-12-25 00:45:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:45:17,420 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 00:45:17,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:45:17,421 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 00:45:17,425 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 00:45:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:45:17,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 00:45:17,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:45:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:45:18,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:45:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:45:34,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:45:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232432319] [2023-12-25 00:45:34,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232432319] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:45:34,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:45:34,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2023-12-25 00:45:34,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439722838] [2023-12-25 00:45:34,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:45:34,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 00:45:34,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:45:34,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 00:45:34,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-12-25 00:45:34,359 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 00:45:56,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:45:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:45:58,230 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-12-25 00:45:58,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 00:45:58,242 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-12-25 00:45:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:45:58,243 INFO L225 Difference]: With dead ends: 55 [2023-12-25 00:45:58,243 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 00:45:58,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-12-25 00:45:58,245 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-12-25 00:45:58,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 122 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 252 Invalid, 1 Unknown, 0 Unchecked, 10.3s Time] [2023-12-25 00:45:58,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 00:45:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2023-12-25 00:45:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:45:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2023-12-25 00:45:58,254 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2023-12-25 00:45:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:45:58,255 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2023-12-25 00:45:58,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 00:45:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2023-12-25 00:45:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 00:45:58,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:45:58,256 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:45:58,265 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 00:45:58,463 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 00:45:58,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:45:58,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:45:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2017352516, now seen corresponding path program 1 times [2023-12-25 00:45:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:45:58,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741517785] [2023-12-25 00:45:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:45:58,465 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 00:45:58,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:45:58,466 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 00:45:58,468 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 00:45:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:45:58,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 00:45:58,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:46:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 00:46:01,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:47:27,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:47:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741517785] [2023-12-25 00:47:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741517785] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 00:47:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1719669134] [2023-12-25 00:47:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:47:27,428 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 00:47:27,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 00:47:27,435 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 00:47:27,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-25 00:47:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:47:27,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 00:47:27,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:47:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 00:47:34,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:48:39,567 WARN L293 SmtUtils]: Spent 5.47s 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 00:49:01,627 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:49:05,979 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64))) (.cse2 (bvneg .cse1)) (.cse5 (bvmul (_ bv2 64) .cse3)) (.cse4 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse3)))) (or (bvsle .cse0 .cse1) (= (_ bv0 64) (bvadd (bvneg (bvmul (bvmul (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv1 64)) .cse0) (_ bv2 64))) .cse2 (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) (bvmul .cse3 (_ bv4 64)) .cse4 (bvneg (bvadd .cse5 |c_ULTIMATE.start_main_~v~0#1| (bvmul .cse2 (_ bv2 64)))))) (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) .cse2 .cse5 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) (_ bv2 64))) .cse4))) (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64)) (not (bvsle |c_ULTIMATE.start_main_~x~0#1| .cse1))))) is different from true [2023-12-25 00:49:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2023-12-25 00:49:06,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1719669134] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:49:06,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 00:49:06,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 32 [2023-12-25 00:49:06,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736254155] [2023-12-25 00:49:06,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 00:49:06,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 00:49:06,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:06,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 00:49:06,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1120, Unknown=1, NotChecked=70, Total=1406 [2023-12-25 00:49:06,038 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 10 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-25 00:49:09,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:49:45,486 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 00:50:03,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:50:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:50:33,587 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2023-12-25 00:50:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 00:50:33,611 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 10 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) Word has length 34 [2023-12-25 00:50:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:50:33,612 INFO L225 Difference]: With dead ends: 71 [2023-12-25 00:50:33,612 INFO L226 Difference]: Without dead ends: 61 [2023-12-25 00:50:33,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 185.0s TimeCoverageRelationStatistics Valid=434, Invalid=2119, Unknown=1, NotChecked=98, Total=2652 [2023-12-25 00:50:33,614 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2023-12-25 00:50:33,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 130 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 341 Invalid, 2 Unknown, 52 Unchecked, 28.3s Time] [2023-12-25 00:50:33,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-25 00:50:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-25 00:50:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 46 states have internal predecessors, (53), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 00:50:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2023-12-25 00:50:33,628 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 34 [2023-12-25 00:50:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:50:33,628 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2023-12-25 00:50:33,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 10 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-25 00:50:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2023-12-25 00:50:33,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 00:50:33,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:50:33,629 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:50:33,642 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 00:50:33,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-25 00:50:34,044 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 00:50:34,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:50:34,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:50:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1224179215, now seen corresponding path program 1 times [2023-12-25 00:50:34,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:50:34,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801768806] [2023-12-25 00:50:34,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:50:34,045 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 00:50:34,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:50:34,046 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 00:50:34,046 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 00:50:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:50:34,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 00:50:34,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:50:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 00:50:41,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:51:19,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:51:19,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801768806] [2023-12-25 00:51:19,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801768806] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 00:51:19,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [976852489] [2023-12-25 00:51:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:51:19,906 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 00:51:19,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 00:51:19,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 00:51:19,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-25 00:51:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:51:20,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 00:51:20,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:51:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 00:51:26,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:52:22,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [976852489] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 00:52:22,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:52:22,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 25 [2023-12-25 00:52:22,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434981851] [2023-12-25 00:52:22,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:52:22,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 00:52:22,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:52:22,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 00:52:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1142, Unknown=1, NotChecked=0, Total=1332 [2023-12-25 00:52:22,538 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 25 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:52:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:52:34,275 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2023-12-25 00:52:34,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 00:52:34,278 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-12-25 00:52:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:52:34,279 INFO L225 Difference]: With dead ends: 68 [2023-12-25 00:52:34,279 INFO L226 Difference]: Without dead ends: 66 [2023-12-25 00:52:34,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 100.1s TimeCoverageRelationStatistics Valid=239, Invalid=1482, Unknown=1, NotChecked=0, Total=1722 [2023-12-25 00:52:34,280 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:52:34,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 74 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-25 00:52:34,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-25 00:52:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2023-12-25 00:52:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 00:52:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-12-25 00:52:34,294 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 36 [2023-12-25 00:52:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:52:34,294 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-12-25 00:52:34,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:52:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-12-25 00:52:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-25 00:52:34,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:52:34,295 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:52:34,304 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 00:52:34,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-25 00:52:34,696 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 00:52:34,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:52:34,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:52:34,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1724148117, now seen corresponding path program 1 times [2023-12-25 00:52:34,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:52:34,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813639062] [2023-12-25 00:52:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:52:34,697 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 00:52:34,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:52:34,698 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 00:52:34,699 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 00:52:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:52:34,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 00:52:34,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:52:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 00:52:39,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:55:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 10 refuted. 2 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 00:55:36,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:55:36,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813639062] [2023-12-25 00:55:36,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813639062] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:55:36,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:55:36,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2023-12-25 00:55:36,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779580852] [2023-12-25 00:55:36,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:55:36,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 00:55:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:55:36,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 00:55:36,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=661, Unknown=3, NotChecked=0, Total=812 [2023-12-25 00:55:36,854 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 29 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 10 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 00:56:49,316 WARN L293 SmtUtils]: Spent 27.34s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:56:51,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:57:40,415 WARN L293 SmtUtils]: Spent 25.02s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:57:47,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:58:17,282 WARN L293 SmtUtils]: Spent 20.18s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:58:21,994 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 00:58:24,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:58:26,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:58:43,983 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 00:58:58,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:59:26,995 WARN L293 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:59:31,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:59:51,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-25 00:59:54,440 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 00:59:54,440 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 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:59:55,455 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 00:59:55,642 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 00:59:55,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 330.1s TimeCoverageRelationStatistics Valid=349, Invalid=1367, Unknown=6, NotChecked=0, Total=1722 [2023-12-25 00:59:55,658 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.5s IncrementalHoareTripleChecker+Time [2023-12-25 00:59:55,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 132 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 349 Invalid, 3 Unknown, 0 Unchecked, 62.5s Time] [2023-12-25 00:59:55,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:59:55,660 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 00:59:55,663 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-25 00:59:55,666 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:59:55,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:59:55 BoogieIcfgContainer [2023-12-25 00:59:55,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 00:59:55,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:59:55,671 INFO L158 Benchmark]: Toolchain (without parser) took 881395.09ms. Allocated memory is still 281.0MB. Free memory was 232.9MB in the beginning and 215.8MB in the end (delta: 17.1MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. [2023-12-25 00:59:55,671 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 176.2MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:59:55,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.20ms. Allocated memory is still 281.0MB. Free memory was 232.9MB in the beginning and 220.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 00:59:55,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.13ms. Allocated memory is still 281.0MB. Free memory was 220.9MB in the beginning and 219.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:59:55,672 INFO L158 Benchmark]: Boogie Preprocessor took 40.72ms. Allocated memory is still 281.0MB. Free memory was 219.3MB in the beginning and 217.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 00:59:55,672 INFO L158 Benchmark]: RCFGBuilder took 549.71ms. Allocated memory is still 281.0MB. Free memory was 217.7MB in the beginning and 204.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 00:59:55,673 INFO L158 Benchmark]: TraceAbstraction took 880547.95ms. Allocated memory is still 281.0MB. Free memory was 203.6MB in the beginning and 215.8MB in the end (delta: -12.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:59:55,674 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.51ms. Allocated memory is still 176.2MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.20ms. Allocated memory is still 281.0MB. Free memory was 232.9MB in the beginning and 220.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.13ms. Allocated memory is still 281.0MB. Free memory was 220.9MB in the beginning and 219.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.72ms. Allocated memory is still 281.0MB. Free memory was 219.3MB in the beginning and 217.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 549.71ms. Allocated memory is still 281.0MB. Free memory was 217.7MB in the beginning and 204.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 880547.95ms. Allocated memory is still 281.0MB. Free memory was 203.6MB in the beginning and 215.8MB in the end (delta: -12.2MB). 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: 16]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 16). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 880.5s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 382.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 104.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 538 SdHoareTripleChecker+Invalid, 99.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 461 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1504 IncrementalHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 77 mSDtfsCounter, 1504 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 260 SyntacticMatches, 8 SemanticMatches, 165 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 641.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 494.2s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 4520 SizeOfPredicates, 49 NumberOfNonLiveVariables, 457 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 109/177 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