/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_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:41:55,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:41:55,835 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:41:55,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:41:55,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:41:55,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:41:55,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:41:55,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:41:55,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:41:55,875 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:41:55,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:41:55,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:41:55,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:41:55,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:41:55,878 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:41:55,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:41:55,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:41:55,879 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:41:55,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:41:55,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:41:55,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:41:55,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:41:55,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:41:55,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:41:55,881 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:41:55,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:41:55,882 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:41:55,882 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:41:55,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:41:55,882 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:41:55,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:41:55,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:41:55,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:41:55,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:41:55,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:41:55,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:41:55,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:41:55,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:41:55,884 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:41:55,884 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:41:55,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:41:55,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:41:55,885 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:41:55,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:41:55,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:41:55,885 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:41:55,886 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:41:56,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:41:56,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:41:56,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:41:56,115 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:41:56,116 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:41:56,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-12-25 00:41:57,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:41:57,496 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:41:57,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-12-25 00:41:57,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7742ecc/4198aaf5bdf749a98d5905760a63d08b/FLAG7e5373e4d [2023-12-25 00:41:57,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7742ecc/4198aaf5bdf749a98d5905760a63d08b [2023-12-25 00:41:57,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:41:57,525 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:41:57,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:41:57,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:41:57,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:41:57,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161cbfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57, skipping insertion in model container [2023-12-25 00:41:57,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,552 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:41:57,689 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_unwindbound20.c[597,610] [2023-12-25 00:41:57,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:41:57,722 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:41:57,732 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_unwindbound20.c[597,610] [2023-12-25 00:41:57,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:41:57,750 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:41:57,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57 WrapperNode [2023-12-25 00:41:57,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:41:57,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:41:57,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:41:57,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:41:57,756 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:41:57" (1/1) ... [2023-12-25 00:41:57,761 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:41:57" (1/1) ... [2023-12-25 00:41:57,774 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-12-25 00:41:57,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:41:57,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:41:57,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:41:57,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:41:57,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,793 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:41:57,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:41:57,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:41:57,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:41:57,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:41:57,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:41:57,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:41:57,835 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:41:57,849 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:41:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:41:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:41:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:41:57,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:41:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:41:57,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:41:57,919 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:41:57,921 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:41:58,356 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:41:58,379 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:41:58,379 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 00:41:58,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:41:58 BoogieIcfgContainer [2023-12-25 00:41:58,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:41:58,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:41:58,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:41:58,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:41:58,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:41:57" (1/3) ... [2023-12-25 00:41:58,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567daabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:41:58, skipping insertion in model container [2023-12-25 00:41:58,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (2/3) ... [2023-12-25 00:41:58,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567daabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:41:58, skipping insertion in model container [2023-12-25 00:41:58,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:41:58" (3/3) ... [2023-12-25 00:41:58,387 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound20.c [2023-12-25 00:41:58,403 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:41:58,403 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:41:58,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:41:58,445 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;@32c16602, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:41:58,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:41:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:41:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 00:41:58,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:41:58,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:41:58,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:41:58,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:41:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2023-12-25 00:41:58,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:41:58,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889175872] [2023-12-25 00:41:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:41:58,472 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:41:58,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:41:58,475 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:41:58,501 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:41:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:41:58,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:41:58,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:41:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:41:59,014 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:41:59,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:41:59,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889175872] [2023-12-25 00:41:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889175872] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:41:59,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:41:59,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 00:41:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439059048] [2023-12-25 00:41:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:41:59,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 00:41:59,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:41:59,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 00:41:59,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 00:41:59,065 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:42:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:42:00,553 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-12-25 00:42:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:42:00,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-25 00:42:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:42:00,563 INFO L225 Difference]: With dead ends: 46 [2023-12-25 00:42:00,563 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 00:42:00,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 00:42:00,568 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 00:42:00,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 00:42:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 00:42:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-12-25 00:42:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:42:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-25 00:42:00,599 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 7 [2023-12-25 00:42:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:42:00,599 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-25 00:42:00,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:42:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-25 00:42:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 00:42:00,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:42:00,600 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:42:00,609 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 00:42:00,806 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:42:00,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:42:00,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:42:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash -479331439, now seen corresponding path program 1 times [2023-12-25 00:42:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:42:00,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150912463] [2023-12-25 00:42:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:42:00,808 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:42:00,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:42:00,810 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:42:00,812 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:42:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:42:03,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 00:42:03,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:42:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:42:05,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:42:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:42:38,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:42:38,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150912463] [2023-12-25 00:42:38,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150912463] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:42:38,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:42:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-12-25 00:42:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156591023] [2023-12-25 00:42:38,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:42:38,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 00:42:38,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:42:38,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 00:42:38,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2023-12-25 00:42:38,242 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:42:46,417 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 00:42:51,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:42:53,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:43:24,624 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 00:43:29,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:43:33,660 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:43:46,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:43:50,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:43:54,496 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:43:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:43:54,496 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-12-25 00:43:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 00:43:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-25 00:43:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:43:54,532 INFO L225 Difference]: With dead ends: 52 [2023-12-25 00:43:54,532 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 00:43:54,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 61.3s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2023-12-25 00:43:54,534 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:43:54,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 79 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 44.2s Time] [2023-12-25 00:43:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 00:43:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2023-12-25 00:43:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:43:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-12-25 00:43:54,544 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 17 [2023-12-25 00:43:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:43:54,546 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-12-25 00:43:54,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:43:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-12-25 00:43:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 00:43:54,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:43:54,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:43:54,561 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:43:54,761 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:43:54,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:43:54,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:43:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1288678065, now seen corresponding path program 1 times [2023-12-25 00:43:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:43:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256839813] [2023-12-25 00:43:54,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:43:54,763 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:43:54,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:43:54,764 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:43:54,765 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:44:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:44:29,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 00:44:29,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:44:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:44:32,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:45:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:45:10,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:45:10,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256839813] [2023-12-25 00:45:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256839813] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:45:10,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:45:10,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-12-25 00:45:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633574933] [2023-12-25 00:45:10,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:45:10,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 00:45:10,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:45:10,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 00:45:10,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2023-12-25 00:45:10,718 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:45:16,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:45:39,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:45:43,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:45:47,543 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 00:46:14,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:46:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:46:15,318 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2023-12-25 00:46:15,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 00:46:15,352 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-25 00:46:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:46:15,354 INFO L225 Difference]: With dead ends: 67 [2023-12-25 00:46:15,354 INFO L226 Difference]: Without dead ends: 63 [2023-12-25 00:46:15,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 69.4s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2023-12-25 00:46:15,355 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:46:15,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 85 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 213 Invalid, 3 Unknown, 0 Unchecked, 30.8s Time] [2023-12-25 00:46:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-25 00:46:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2023-12-25 00:46:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:46:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-12-25 00:46:15,372 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 17 [2023-12-25 00:46:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:46:15,372 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-12-25 00:46:15,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:46:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-12-25 00:46:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 00:46:15,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:46:15,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:46:15,421 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 (4)] Ended with exit code 0 [2023-12-25 00:46:15,588 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:46:15,589 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:46:15,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:46:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1366888132, now seen corresponding path program 1 times [2023-12-25 00:46:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:46:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778708007] [2023-12-25 00:46:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:46:15,590 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:46:15,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:46:15,591 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:46:15,593 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:46:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:46:15,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 00:46:15,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:46:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:46:15,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:46:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:46:15,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:46:15,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778708007] [2023-12-25 00:46:15,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778708007] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:46:15,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:46:15,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 00:46:15,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726014690] [2023-12-25 00:46:15,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:46:15,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 00:46:15,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:46:15,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 00:46:15,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 00:46:15,927 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:46:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:46:17,239 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2023-12-25 00:46:17,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 00:46:17,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 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:46:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:46:17,242 INFO L225 Difference]: With dead ends: 104 [2023-12-25 00:46:17,242 INFO L226 Difference]: Without dead ends: 98 [2023-12-25 00:46:17,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:46:17,243 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:46:17,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 00:46:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-25 00:46:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 58. [2023-12-25 00:46:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 00:46:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2023-12-25 00:46:17,293 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 18 [2023-12-25 00:46:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:46:17,293 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2023-12-25 00:46:17,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:46:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2023-12-25 00:46:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 00:46:17,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:46:17,294 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:46:17,308 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:46:17,504 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 00:46:17,504 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:46:17,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:46:17,505 INFO L85 PathProgramCache]: Analyzing trace with hash -382706270, now seen corresponding path program 1 times [2023-12-25 00:46:17,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:46:17,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303943450] [2023-12-25 00:46:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:46:17,505 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:46:17,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:46:17,507 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 00:46:17,510 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 00:46:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:46:19,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 00:46:19,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:46:45,548 WARN L293 SmtUtils]: Spent 8.15s 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 00:46:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 00:46:47,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:48:20,467 WARN L293 SmtUtils]: Spent 8.10s 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:48:29,019 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse2 (bvneg .cse1)) (.cse7 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv1 64))) (.cse0 (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64))) (.cse4 (bvmul .cse7 (_ bv4 64))) (.cse5 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse7))) (.cse6 (bvneg (bvadd (bvmul (_ bv2 64) .cse7) |c_ULTIMATE.start_main_~v~0#1| (bvmul .cse2 (_ bv2 64)))))) (or (bvsle .cse0 .cse1) (not (= (_ bv0 64) (bvadd .cse2 (bvneg (bvmul (_ bv2 64) (bvmul .cse1 .cse3))) .cse4 .cse5 .cse6))) (= (_ bv0 64) (bvadd (bvneg (bvmul (bvmul .cse3 .cse0) (_ bv2 64))) .cse2 (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse4 .cse5 .cse6)) (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:48:50,713 WARN L293 SmtUtils]: Spent 8.13s 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:16,436 WARN L293 SmtUtils]: Spent 8.13s 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:42,803 WARN L293 SmtUtils]: Spent 8.13s 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:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-12-25 00:49:47,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:49:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303943450] [2023-12-25 00:49:47,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303943450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:49:47,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:49:47,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2023-12-25 00:49:47,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490402357] [2023-12-25 00:49:47,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:49:47,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 00:49:47,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:47,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 00:49:47,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=416, Unknown=3, NotChecked=42, Total=552 [2023-12-25 00:49:47,152 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 24 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:50:27,113 WARN L293 SmtUtils]: Spent 20.76s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:50:31,765 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 00:50:33,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:50:35,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:50:40,626 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 00:50:44,689 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:51:02,285 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 00:51:07,354 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 00:51:11,357 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 00:51:15,360 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 00:51:21,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:51:27,065 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:51:31,137 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 00:51:37,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:51:41,353 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:51:44,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:51:48,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:51:52,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:52:01,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:52:05,638 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 00:52:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:52:30,803 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2023-12-25 00:52:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 00:52:30,804 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2023-12-25 00:52:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:52:30,805 INFO L225 Difference]: With dead ends: 72 [2023-12-25 00:52:30,805 INFO L226 Difference]: Without dead ends: 64 [2023-12-25 00:52:30,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 160.4s TimeCoverageRelationStatistics Valid=210, Invalid=913, Unknown=3, NotChecked=64, Total=1190 [2023-12-25 00:52:30,806 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 17 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 84.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 86.1s IncrementalHoareTripleChecker+Time [2023-12-25 00:52:30,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 85 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 223 Invalid, 13 Unknown, 44 Unchecked, 86.1s Time] [2023-12-25 00:52:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-25 00:52:30,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-25 00:52:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:52:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-12-25 00:52:30,830 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 24 [2023-12-25 00:52:30,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:52:30,830 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-12-25 00:52:30,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:52:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-12-25 00:52:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 00:52:30,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:52:30,831 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 00:52:30,841 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 (6)] Ended with exit code 0 [2023-12-25 00:52:31,040 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 00:52:31,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:52:31,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:52:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash 506464861, now seen corresponding path program 1 times [2023-12-25 00:52:31,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:52:31,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691634247] [2023-12-25 00:52:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:52:31,041 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:31,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:52:31,042 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:52:31,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:52:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:52:33,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 00:52:33,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:52:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:52:40,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:53:55,425 WARN L293 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:54:27,563 WARN L293 SmtUtils]: Spent 8.13s 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 00:54:37,135 WARN L293 SmtUtils]: Spent 5.40s 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 00:54:45,960 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ 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)) (.cse3 (bvmul .cse6 (_ bv4 64))) (.cse4 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse6))) (.cse5 (bvneg (bvadd (bvmul (_ bv2 64) .cse6) |c_ULTIMATE.start_main_~v~0#1|)))) (or (bvsle .cse0 .cse1) (= (_ bv0 64) (bvadd .cse2 (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse3 .cse4 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse0) (_ bv2 64))) .cse5)) (not (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64))) (not (= (bvadd .cse2 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) (_ bv2 64))) .cse3 .cse4 .cse5) (_ bv0 64))) (not (bvsle |c_ULTIMATE.start_main_~x~0#1| .cse1))))) is different from true [2023-12-25 00:54:58,580 WARN L293 SmtUtils]: Spent 8.13s 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 00:55:25,130 WARN L293 SmtUtils]: Spent 8.14s 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 00:55:52,075 WARN L293 SmtUtils]: Spent 8.11s 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 00:56:18,071 WARN L293 SmtUtils]: Spent 8.12s 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 00:56:35,374 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse0 (bvneg .cse1)) (.cse5 (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse2 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse6))) (.cse3 (bvneg (bvadd (bvmul (_ bv2 64) .cse6) |c_ULTIMATE.start_main_~v~0#1|))) (.cse4 (bvmul .cse6 (_ bv6 64)))) (or (not (= (_ bv0 64) (bvadd .cse0 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) (_ bv2 64))) .cse2 .cse3 .cse4))) (bvsle .cse5 .cse1) (not (bvsle (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64)) .cse1)) (= (_ bv0 64) (bvadd .cse0 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse5) (_ bv2 64))) (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse2 .cse3 .cse4)) (not (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64)))))) is different from true Received shutdown request... [2023-12-25 00:56:41,176 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:56:41,177 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:56:42,194 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:56:42,379 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:56:42,397 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:56:42,399 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:56:42,400 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-25 00:56:42,405 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-25 00:56:42,407 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:56:42,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:56:42 BoogieIcfgContainer [2023-12-25 00:56:42,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:56:42,409 INFO L158 Benchmark]: Toolchain (without parser) took 884884.06ms. Allocated memory was 208.7MB in the beginning and 286.3MB in the end (delta: 77.6MB). Free memory was 162.4MB in the beginning and 154.5MB in the end (delta: 7.9MB). Peak memory consumption was 85.3MB. Max. memory is 8.0GB. [2023-12-25 00:56:42,409 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 208.7MB. Free memory is still 165.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:56:42,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.57ms. Allocated memory is still 208.7MB. Free memory was 162.1MB in the beginning and 150.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 00:56:42,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.67ms. Allocated memory is still 208.7MB. Free memory was 150.5MB in the beginning and 148.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:56:42,410 INFO L158 Benchmark]: Boogie Preprocessor took 27.12ms. Allocated memory is still 208.7MB. Free memory was 148.8MB in the beginning and 147.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 00:56:42,410 INFO L158 Benchmark]: RCFGBuilder took 577.04ms. Allocated memory is still 208.7MB. Free memory was 147.0MB in the beginning and 133.8MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 00:56:42,410 INFO L158 Benchmark]: TraceAbstraction took 884026.52ms. Allocated memory was 208.7MB in the beginning and 286.3MB in the end (delta: 77.6MB). Free memory was 133.1MB in the beginning and 154.5MB in the end (delta: -21.4MB). Peak memory consumption was 56.0MB. Max. memory is 8.0GB. [2023-12-25 00:56:42,412 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 208.7MB. Free memory is still 165.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.57ms. Allocated memory is still 208.7MB. Free memory was 162.1MB in the beginning and 150.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.67ms. Allocated memory is still 208.7MB. Free memory was 150.5MB in the beginning and 148.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.12ms. Allocated memory is still 208.7MB. Free memory was 148.8MB in the beginning and 147.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 577.04ms. Allocated memory is still 208.7MB. Free memory was 147.0MB in the beginning and 133.8MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 884026.52ms. Allocated memory was 208.7MB in the beginning and 286.3MB in the end (delta: 77.6MB). Free memory was 133.1MB in the beginning and 154.5MB in the end (delta: -21.4MB). Peak memory consumption was 56.0MB. 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 NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 884.0s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 307.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 23 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 163.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 160.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 44 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 732 IncrementalHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 47 mSDtfsCounter, 732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 291.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=5, InterpolantAutomatonStates: 78, 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, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 39.7s SatisfiabilityAnalysisTime, 284.0s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 2367 SizeOfPredicates, 21 NumberOfNonLiveVariables, 212 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 26/52 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