/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/cohendiv-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:58:27,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:58:27,079 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:58:27,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:58:27,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:58:27,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:58:27,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:58:27,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:58:27,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:58:27,113 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:58:27,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:58:27,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:58:27,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:58:27,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:58:27,115 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:58:27,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:58:27,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:58:27,116 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:58:27,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:58:27,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:58:27,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:58:27,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:58:27,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:58:27,117 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:58:27,117 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:58:27,118 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:58:27,118 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:58:27,118 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:58:27,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:58:27,118 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:58:27,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:58:27,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:58:27,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:58:27,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:58:27,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:58:27,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:58:27,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:58:27,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:58:27,120 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:58:27,120 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:58:27,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:58:27,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:58:27,120 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:58:27,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:58:27,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:58:27,121 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:58:27,121 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:58:27,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:58:27,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:58:27,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:58:27,315 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:58:27,315 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:58:27,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound20.c [2023-12-25 00:58:28,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:58:28,380 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:58:28,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound20.c [2023-12-25 00:58:28,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76855e92/aabd2a3f90ae464192c8fadc183037c3/FLAG66533bd55 [2023-12-25 00:58:28,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76855e92/aabd2a3f90ae464192c8fadc183037c3 [2023-12-25 00:58:28,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:58:28,401 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:58:28,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:58:28,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:58:28,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:58:28,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba480b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28, skipping insertion in model container [2023-12-25 00:58:28,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,421 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:58:28,534 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/cohendiv-ll_valuebound20.c[576,589] [2023-12-25 00:58:28,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:58:28,559 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:58:28,567 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/cohendiv-ll_valuebound20.c[576,589] [2023-12-25 00:58:28,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:58:28,586 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:58:28,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28 WrapperNode [2023-12-25 00:58:28,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:58:28,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:58:28,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:58:28,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:58:28,592 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:58:28" (1/1) ... [2023-12-25 00:58:28,600 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:58:28" (1/1) ... [2023-12-25 00:58:28,616 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-25 00:58:28,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:58:28,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:58:28,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:58:28,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:58:28,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,636 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:58:28,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:58:28,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:58:28,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:58:28,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:58:28,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (1/1) ... [2023-12-25 00:58:28,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:58:28,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:58:28,673 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:58:28,674 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:58:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:58:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:58:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 00:58:28,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 00:58:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:58:28,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:58:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:58:28,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:58:28,738 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:58:28,748 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:58:28,885 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:58:28,901 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:58:28,902 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 00:58:28,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:58:28 BoogieIcfgContainer [2023-12-25 00:58:28,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:58:28,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:58:28,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:58:28,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:58:28,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:58:28" (1/3) ... [2023-12-25 00:58:28,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6f1801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:58:28, skipping insertion in model container [2023-12-25 00:58:28,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:28" (2/3) ... [2023-12-25 00:58:28,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6f1801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:58:28, skipping insertion in model container [2023-12-25 00:58:28,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:58:28" (3/3) ... [2023-12-25 00:58:28,908 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound20.c [2023-12-25 00:58:28,919 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:58:28,919 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:58:28,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:58:28,952 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;@edd1e93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:58:28,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:58:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 00:58:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 00:58:28,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:58:28,961 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:58:28,961 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:58:28,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:58:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1096708698, now seen corresponding path program 1 times [2023-12-25 00:58:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:58:28,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145216387] [2023-12-25 00:58:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:58:28,973 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:58:28,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:58:28,974 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:58:28,977 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:58:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:58:29,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:58:29,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:58:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 00:58:29,067 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:58:29,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:58:29,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145216387] [2023-12-25 00:58:29,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145216387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:58:29,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:58:29,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:58:29,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370410894] [2023-12-25 00:58:29,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:58:29,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:58:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:58:29,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:58:29,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:58:29,091 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 00:58:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:58:29,111 INFO L93 Difference]: Finished difference Result 60 states and 99 transitions. [2023-12-25 00:58:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:58:29,113 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 00:58:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:58:29,117 INFO L225 Difference]: With dead ends: 60 [2023-12-25 00:58:29,117 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 00:58:29,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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:58:29,121 INFO L413 NwaCegarLoop]: 38 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, 38 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:58:29,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:58:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 00:58:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 00:58:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 00:58:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-12-25 00:58:29,146 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 23 [2023-12-25 00:58:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:58:29,147 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-12-25 00:58:29,147 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 00:58:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-12-25 00:58:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 00:58:29,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:58:29,148 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:58:29,152 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:58:29,354 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:58:29,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:58:29,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:58:29,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2049551268, now seen corresponding path program 1 times [2023-12-25 00:58:29,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:58:29,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047989020] [2023-12-25 00:58:29,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:58:29,356 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:58:29,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:58:29,357 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:58:29,358 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:58:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:58:29,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:58:29,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:58:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:58:29,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:58:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 00:58:30,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:58:30,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047989020] [2023-12-25 00:58:30,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047989020] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 00:58:30,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:58:30,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-25 00:58:30,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581389651] [2023-12-25 00:58:30,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:58:30,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:58:30,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:58:30,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:58:30,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-25 00:58:30,662 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 00:58:35,790 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:58:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:58:36,351 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-12-25 00:58:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:58:36,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-25 00:58:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:58:36,353 INFO L225 Difference]: With dead ends: 48 [2023-12-25 00:58:36,353 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 00:58:36,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:58:36,354 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-25 00:58:36,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2023-12-25 00:58:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 00:58:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2023-12-25 00:58:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-25 00:58:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-12-25 00:58:36,363 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 23 [2023-12-25 00:58:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:58:36,364 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-12-25 00:58:36,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 00:58:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-12-25 00:58:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 00:58:36,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:58:36,365 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:58:36,372 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:58:36,567 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:58:36,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:58:36,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:58:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1906772284, now seen corresponding path program 1 times [2023-12-25 00:58:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:58:36,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246630050] [2023-12-25 00:58:36,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:58:36,569 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:58:36,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:58:36,570 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:58:36,584 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:58:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:58:36,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 00:58:36,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:58:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:58:36,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:58:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 00:58:38,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:58:38,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246630050] [2023-12-25 00:58:38,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246630050] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 00:58:38,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:58:38,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 00:58:38,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929186217] [2023-12-25 00:58:38,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:58:38,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:58:38,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:58:38,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:58:38,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:58:38,249 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:58:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:58:39,874 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2023-12-25 00:58:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:58:39,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-25 00:58:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:58:39,881 INFO L225 Difference]: With dead ends: 66 [2023-12-25 00:58:39,881 INFO L226 Difference]: Without dead ends: 63 [2023-12-25 00:58:39,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 00:58:39,882 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 00:58:39,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 00:58:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-25 00:58:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2023-12-25 00:58:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 00:58:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2023-12-25 00:58:39,896 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 28 [2023-12-25 00:58:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:58:39,896 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2023-12-25 00:58:39,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:58:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2023-12-25 00:58:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 00:58:39,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:58:39,897 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:58:39,916 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:58:40,101 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:58:40,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:58:40,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:58:40,102 INFO L85 PathProgramCache]: Analyzing trace with hash -170967411, now seen corresponding path program 1 times [2023-12-25 00:58:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:58:40,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270758403] [2023-12-25 00:58:40,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:58:40,103 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:58:40,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:58:40,104 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:58:40,110 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:58:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:58:40,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 00:58:40,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:58:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 00:58:40,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:58:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 00:58:40,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:58:40,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270758403] [2023-12-25 00:58:40,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270758403] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:58:40,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:58:40,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-25 00:58:40,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332762653] [2023-12-25 00:58:40,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:58:40,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 00:58:40,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:58:40,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 00:58:40,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-25 00:58:40,550 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 00:58:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:58:41,387 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2023-12-25 00:58:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 00:58:41,392 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 45 [2023-12-25 00:58:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:58:41,393 INFO L225 Difference]: With dead ends: 69 [2023-12-25 00:58:41,393 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 00:58:41,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:58:41,394 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:58:41,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 182 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 00:58:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 00:58:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2023-12-25 00:58:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 00:58:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2023-12-25 00:58:41,405 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 45 [2023-12-25 00:58:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:58:41,405 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2023-12-25 00:58:41,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 00:58:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2023-12-25 00:58:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 00:58:41,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:58:41,406 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:58:41,414 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:58:41,608 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:58:41,609 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:58:41,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:58:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1378270461, now seen corresponding path program 1 times [2023-12-25 00:58:41,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:58:41,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22618394] [2023-12-25 00:58:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:58:41,610 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:58:41,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:58:41,612 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:58:41,612 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:58:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:58:41,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 00:58:41,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:58:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-25 00:58:42,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:59:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-25 00:59:01,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:59:01,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22618394] [2023-12-25 00:59:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22618394] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:59:01,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:59:01,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2023-12-25 00:59:01,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105028309] [2023-12-25 00:59:01,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:59:01,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 00:59:01,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:59:01,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 00:59:01,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=353, Unknown=2, NotChecked=0, Total=420 [2023-12-25 00:59:01,802 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-12-25 00:59:07,266 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:59:11,330 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:59:22,074 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 [0] [2023-12-25 00:59:26,142 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:59:30,183 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:59:34,202 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:59:38,285 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 [0] [2023-12-25 00:59:46,510 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 [0] [2023-12-25 00:59:50,549 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:59:52,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:59:53,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:59:57,294 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 01:00:03,073 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 01:00:07,195 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 01:00:11,253 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 01:00:15,301 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 01:00:19,309 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 01:00:23,351 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 01:00:27,416 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 01:00:31,476 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 01:00:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:00:31,574 INFO L93 Difference]: Finished difference Result 103 states and 140 transitions. [2023-12-25 01:00:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 01:00:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) Word has length 51 [2023-12-25 01:00:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:00:31,583 INFO L225 Difference]: With dead ends: 103 [2023-12-25 01:00:31,583 INFO L226 Difference]: Without dead ends: 101 [2023-12-25 01:00:31,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=166, Invalid=761, Unknown=3, NotChecked=0, Total=930 [2023-12-25 01:00:31,592 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 101 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 84 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 81.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:00:31,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 158 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 220 Invalid, 18 Unknown, 0 Unchecked, 81.1s Time] [2023-12-25 01:00:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-25 01:00:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2023-12-25 01:00:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.18) internal successors, (59), 53 states have internal predecessors, (59), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-25 01:00:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2023-12-25 01:00:31,615 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 51 [2023-12-25 01:00:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:00:31,615 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2023-12-25 01:00:31,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-12-25 01:00:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2023-12-25 01:00:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 01:00:31,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:00:31,617 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:00:31,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 01:00:31,817 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 01:00:31,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:00:31,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:00:31,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1550111725, now seen corresponding path program 1 times [2023-12-25 01:00:31,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:00:31,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842334085] [2023-12-25 01:00:31,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:00:31,818 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 01:00:31,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:00:31,819 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 01:00:31,820 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 01:00:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:00:31,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 01:00:31,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:00:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 01:00:33,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:00:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 01:00:51,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:00:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842334085] [2023-12-25 01:00:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842334085] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:00:51,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:00:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2023-12-25 01:00:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383082654] [2023-12-25 01:00:51,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:00:51,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:00:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:00:51,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:00:51,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:00:51,129 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 01:01:05,177 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 01:01:09,331 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 01:01:14,362 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 01:01:18,448 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 01:01:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:26,927 INFO L93 Difference]: Finished difference Result 107 states and 140 transitions. [2023-12-25 01:01:26,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 01:01:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2023-12-25 01:01:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:26,955 INFO L225 Difference]: With dead ends: 107 [2023-12-25 01:01:26,955 INFO L226 Difference]: Without dead ends: 104 [2023-12-25 01:01:26,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:01:26,956 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 30 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:26,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 140 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 82 Invalid, 4 Unknown, 0 Unchecked, 28.9s Time] [2023-12-25 01:01:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-25 01:01:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2023-12-25 01:01:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 33 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-25 01:01:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2023-12-25 01:01:26,981 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 58 [2023-12-25 01:01:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:26,981 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2023-12-25 01:01:26,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 01:01:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2023-12-25 01:01:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 01:01:26,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:26,999 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:27,008 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 (7)] Ended with exit code 0 [2023-12-25 01:01:27,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:27,207 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:27,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash -426664645, now seen corresponding path program 1 times [2023-12-25 01:01:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:27,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430770375] [2023-12-25 01:01:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:01:27,208 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 01:01:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:27,209 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:01:27,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 01:01:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:01:27,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 01:01:27,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-25 01:01:28,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:01:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-25 01:01:38,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:01:38,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430770375] [2023-12-25 01:01:38,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430770375] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:01:38,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:01:38,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 19 [2023-12-25 01:01:38,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989273631] [2023-12-25 01:01:38,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:01:38,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:01:38,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:01:38,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:01:38,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:01:38,259 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 10 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2023-12-25 01:01:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:47,733 INFO L93 Difference]: Finished difference Result 143 states and 194 transitions. [2023-12-25 01:01:47,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 01:01:47,734 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 10 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 58 [2023-12-25 01:01:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:47,736 INFO L225 Difference]: With dead ends: 143 [2023-12-25 01:01:47,736 INFO L226 Difference]: Without dead ends: 141 [2023-12-25 01:01:47,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2023-12-25 01:01:47,739 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 99 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:47,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 327 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-12-25 01:01:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-25 01:01:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 103. [2023-12-25 01:01:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 62 states have internal predecessors, (67), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-25 01:01:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2023-12-25 01:01:47,774 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 58 [2023-12-25 01:01:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:47,774 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2023-12-25 01:01:47,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 10 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2023-12-25 01:01:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2023-12-25 01:01:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 01:01:47,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:47,781 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:47,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 01:01:47,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:47,988 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:47,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:47,989 INFO L85 PathProgramCache]: Analyzing trace with hash 673882661, now seen corresponding path program 1 times [2023-12-25 01:01:47,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:47,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235199081] [2023-12-25 01:01:47,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:01:47,989 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 01:01:47,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:47,990 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 01:01:47,991 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 01:01:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:01:48,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 01:01:48,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 40 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-25 01:01:50,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:03:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 39 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-25 01:03:17,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:03:17,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235199081] [2023-12-25 01:03:17,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235199081] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:03:17,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:03:17,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2023-12-25 01:03:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197361789] [2023-12-25 01:03:17,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:03:17,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 01:03:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:03:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 01:03:17,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:03:17,082 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 27 states, 25 states have (on average 1.68) internal successors, (42), 22 states have internal predecessors, (42), 14 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 14 states have call predecessors, (26), 14 states have call successors, (26) [2023-12-25 01:03:49,553 WARN L293 SmtUtils]: Spent 13.18s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:04:05,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:09,731 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 01:04:13,749 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 01:04:17,761 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 01:04:21,773 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 01:04:26,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:28,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:30,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:31,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:36,551 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 01:04:40,663 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 01:04:44,683 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 01:04:48,696 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 01:04:55,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:58,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:00,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:04,328 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 [] [2023-12-25 01:05:08,346 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 01:05:12,366 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 01:05:16,382 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 01:05:20,393 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 01:05:24,841 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 01:05:28,860 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 01:05:32,880 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 01:05:36,896 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 01:05:43,831 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 01:05:47,963 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 01:05:51,984 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 01:05:56,057 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 01:06:00,071 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 01:06:04,984 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 01:06:09,041 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 01:06:13,145 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 01:06:17,160 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 01:06:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:06:21,180 INFO L93 Difference]: Finished difference Result 157 states and 203 transitions. [2023-12-25 01:06:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 01:06:21,196 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 22 states have internal predecessors, (42), 14 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 14 states have call predecessors, (26), 14 states have call successors, (26) Word has length 81 [2023-12-25 01:06:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:06:21,198 INFO L225 Difference]: With dead ends: 157 [2023-12-25 01:06:21,198 INFO L226 Difference]: Without dead ends: 153 [2023-12-25 01:06:21,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 105.0s TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 01:06:21,199 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 84 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 116 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 141.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 143.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:06:21,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 362 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 490 Invalid, 27 Unknown, 0 Unchecked, 143.8s Time] [2023-12-25 01:06:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-12-25 01:06:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2023-12-25 01:06:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 86 states have (on average 1.1162790697674418) internal successors, (96), 91 states have internal predecessors, (96), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-25 01:06:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2023-12-25 01:06:21,240 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 81 [2023-12-25 01:06:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:06:21,241 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2023-12-25 01:06:21,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 22 states have internal predecessors, (42), 14 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 14 states have call predecessors, (26), 14 states have call successors, (26) [2023-12-25 01:06:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2023-12-25 01:06:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-25 01:06:21,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:06:21,244 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:06:21,255 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 (9)] Ended with exit code 0 [2023-12-25 01:06:21,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:06:21,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:06:21,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:06:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2103046358, now seen corresponding path program 2 times [2023-12-25 01:06:21,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:06:21,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978259647] [2023-12-25 01:06:21,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:06:21,454 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 01:06:21,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:06:21,455 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:06:21,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 01:06:21,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:06:21,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:06:21,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:06:21,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:06:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 37 proven. 15 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2023-12-25 01:06:22,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:06:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 37 proven. 15 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2023-12-25 01:06:22,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:06:22,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978259647] [2023-12-25 01:06:22,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978259647] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:06:22,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:06:22,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-25 01:06:22,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980873026] [2023-12-25 01:06:22,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:06:22,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 01:06:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:06:22,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 01:06:22,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:06:22,892 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2023-12-25 01:06:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:06:23,716 INFO L93 Difference]: Finished difference Result 164 states and 205 transitions. [2023-12-25 01:06:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:06:23,717 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 121 [2023-12-25 01:06:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:06:23,718 INFO L225 Difference]: With dead ends: 164 [2023-12-25 01:06:23,718 INFO L226 Difference]: Without dead ends: 162 [2023-12-25 01:06:23,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-12-25 01:06:23,719 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:06:23,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 192 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 01:06:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-25 01:06:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 143. [2023-12-25 01:06:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 91 states have internal predecessors, (94), 40 states have call successors, (40), 16 states have call predecessors, (40), 16 states have return successors, (40), 35 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-25 01:06:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2023-12-25 01:06:23,749 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 121 [2023-12-25 01:06:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:06:23,751 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2023-12-25 01:06:23,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2023-12-25 01:06:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2023-12-25 01:06:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-25 01:06:23,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:06:23,753 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:06:23,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 01:06:23,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:06:23,968 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:06:23,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:06:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1592981926, now seen corresponding path program 3 times [2023-12-25 01:06:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:06:23,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76363950] [2023-12-25 01:06:23,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:06:23,969 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 01:06:23,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:06:23,970 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:06:23,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process Received shutdown request... [2023-12-25 01:13:12,676 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 01:13:12,677 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:13:13,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-25 01:13:13,884 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forcibly destroying the process [2023-12-25 01:13:13,937 ERROR L246 FreeRefinementEngine]: Caught known exception: Timeout or Toolchain cancelled by user [2023-12-25 01:13:13,938 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:13:13,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 01:13:13,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 137 [2023-12-25 01:13:13,941 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 128 with TraceHistMax 19,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [76363950] and IpTcStrategyModuleCvc4 [332590472]. [2023-12-25 01:13:13,944 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:13:13,945 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:13:13,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:13:13 BoogieIcfgContainer [2023-12-25 01:13:13,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:13:13,947 INFO L158 Benchmark]: Toolchain (without parser) took 885546.03ms. Allocated memory is still 377.5MB. Free memory was 323.4MB in the beginning and 278.4MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2023-12-25 01:13:13,947 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 208.7MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:13:13,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.88ms. Allocated memory is still 377.5MB. Free memory was 323.4MB in the beginning and 311.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:13:13,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.72ms. Allocated memory is still 377.5MB. Free memory was 311.9MB in the beginning and 310.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 01:13:13,947 INFO L158 Benchmark]: Boogie Preprocessor took 30.98ms. Allocated memory is still 377.5MB. Free memory was 310.3MB in the beginning and 308.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:13:13,948 INFO L158 Benchmark]: RCFGBuilder took 253.32ms. Allocated memory is still 377.5MB. Free memory was 308.2MB in the beginning and 294.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 01:13:13,948 INFO L158 Benchmark]: TraceAbstraction took 885042.98ms. Allocated memory is still 377.5MB. Free memory was 294.0MB in the beginning and 278.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2023-12-25 01:13:13,948 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.41ms. Allocated memory is still 208.7MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.88ms. Allocated memory is still 377.5MB. Free memory was 323.4MB in the beginning and 311.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.72ms. Allocated memory is still 377.5MB. Free memory was 311.9MB in the beginning and 310.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.98ms. Allocated memory is still 377.5MB. Free memory was 310.3MB in the beginning and 308.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 253.32ms. Allocated memory is still 377.5MB. Free memory was 308.2MB in the beginning and 294.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 885042.98ms. Allocated memory is still 377.5MB. Free memory was 294.0MB in the beginning and 278.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.7MB. 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: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while NwaCegarLoop was analyzing trace of length 128 with TraceHistMax 19,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [76363950] and IpTcStrategyModuleCvc4 [332590472]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 885.0s, OverallIterations: 10, TraceHistogramMax: 19, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 328.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 50 mSolverCounterUnknown, 413 SdHoareTripleChecker+Valid, 268.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 1609 SdHoareTripleChecker+Invalid, 262.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1351 mSDsCounter, 344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1579 IncrementalHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 344 mSolverCounterUnsat, 258 mSDtfsCounter, 1579 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 983 GetRequests, 823 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 163.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=8, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 143.4s InterpolantComputationTime, 488 NumberOfCodeBlocks, 488 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 936 ConstructedInterpolants, 35 QuantifiedInterpolants, 4414 SizeOfPredicates, 41 NumberOfNonLiveVariables, 805 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 2126/2308 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