/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/dijkstra-u_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:46:04,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:46:04,926 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-16 16:46:04,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:46:04,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:46:04,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:46:04,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:46:04,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:46:04,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:46:04,965 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:46:04,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:46:04,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:46:04,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:46:04,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:46:04,968 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:46:04,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:46:04,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:46:04,969 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:46:04,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:46:04,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:46:04,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:46:04,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:46:04,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:46:04,971 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:46:04,971 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:46:04,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:46:04,972 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:46:04,972 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:46:04,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:46:04,972 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:46:04,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:46:04,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:46:04,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:46:04,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:46:04,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:46:04,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:46:04,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:46:04,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:46:04,975 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:46:04,975 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:46:04,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:46:04,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:46:04,976 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:46:04,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:46:04,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:46:04,976 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:46:04,977 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-16 16:46:05,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:46:05,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:46:05,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:46:05,231 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:46:05,232 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:46:05,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2023-12-16 16:46:06,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:46:06,521 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:46:06,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2023-12-16 16:46:06,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dacb4aa43/39d20cbdf60c4bc79e184b506dde930c/FLAGeca5aed38 [2023-12-16 16:46:06,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dacb4aa43/39d20cbdf60c4bc79e184b506dde930c [2023-12-16 16:46:06,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:46:06,547 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:46:06,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:46:06,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:46:06,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:46:06,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710a04c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06, skipping insertion in model container [2023-12-16 16:46:06,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,595 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:46:06,723 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/dijkstra-u_unwindbound10.c[525,538] [2023-12-16 16:46:06,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:46:06,760 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:46:06,772 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/dijkstra-u_unwindbound10.c[525,538] [2023-12-16 16:46:06,790 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:46:06,802 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:46:06,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06 WrapperNode [2023-12-16 16:46:06,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:46:06,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:46:06,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:46:06,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:46:06,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,845 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-12-16 16:46:06,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:46:06,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:46:06,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:46:06,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:46:06,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,868 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-16 16:46:06,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:46:06,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:46:06,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:46:06,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:46:06,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (1/1) ... [2023-12-16 16:46:06,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:46:06,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:46:06,965 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-16 16:46:06,992 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-16 16:46:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:46:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:46:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:46:07,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:46:07,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 16:46:07,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 16:46:07,063 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:46:07,067 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:46:07,278 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:46:07,319 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:46:07,319 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 16:46:07,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:46:07 BoogieIcfgContainer [2023-12-16 16:46:07,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:46:07,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:46:07,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:46:07,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:46:07,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:46:06" (1/3) ... [2023-12-16 16:46:07,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dbf2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:46:07, skipping insertion in model container [2023-12-16 16:46:07,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:06" (2/3) ... [2023-12-16 16:46:07,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dbf2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:46:07, skipping insertion in model container [2023-12-16 16:46:07,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:46:07" (3/3) ... [2023-12-16 16:46:07,329 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound10.c [2023-12-16 16:46:07,345 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:46:07,345 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:46:07,379 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:46:07,386 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;@a01dd02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:46:07,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:46:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 16:46:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:46:07,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:07,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:07,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:07,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2020981481, now seen corresponding path program 1 times [2023-12-16 16:46:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:07,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336968358] [2023-12-16 16:46:07,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:07,422 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-16 16:46:07,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:07,425 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-16 16:46:07,429 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-16 16:46:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:07,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:46:07,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:07,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:46:07,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:07,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336968358] [2023-12-16 16:46:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336968358] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:46:07,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:46:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:46:07,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154109502] [2023-12-16 16:46:07,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:46:07,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:46:07,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:07,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:46:07,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:46:07,567 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:07,598 INFO L93 Difference]: Finished difference Result 52 states and 92 transitions. [2023-12-16 16:46:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:46:07,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 16:46:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:07,607 INFO L225 Difference]: With dead ends: 52 [2023-12-16 16:46:07,607 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 16:46:07,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-16 16:46:07,615 INFO L413 NwaCegarLoop]: 37 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, 37 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-16 16:46:07,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:46:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 16:46:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-16 16:46:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 16:46:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2023-12-16 16:46:07,645 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 9 [2023-12-16 16:46:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:07,645 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2023-12-16 16:46:07,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2023-12-16 16:46:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 16:46:07,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:07,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:07,655 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-16 16:46:07,851 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-16 16:46:07,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:07,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 10324464, now seen corresponding path program 1 times [2023-12-16 16:46:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:07,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303738966] [2023-12-16 16:46:07,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:07,854 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-16 16:46:07,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:07,855 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-16 16:46:07,857 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-16 16:46:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:07,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:46:07,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:07,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:46:07,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:07,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303738966] [2023-12-16 16:46:07,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303738966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:46:07,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:46:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:46:07,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720576] [2023-12-16 16:46:07,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:46:07,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:46:07,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:07,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:46:07,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:46:07,995 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:08,026 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-12-16 16:46:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:46:08,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-16 16:46:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:08,031 INFO L225 Difference]: With dead ends: 46 [2023-12-16 16:46:08,031 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:46:08,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:46:08,033 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:08,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:46:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:46:08,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 16:46:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 16:46:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2023-12-16 16:46:08,040 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 11 [2023-12-16 16:46:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:08,040 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2023-12-16 16:46:08,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2023-12-16 16:46:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:46:08,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:08,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:08,051 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-16 16:46:08,252 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-16 16:46:08,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:08,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash -21038528, now seen corresponding path program 1 times [2023-12-16 16:46:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:08,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020370375] [2023-12-16 16:46:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:08,254 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-16 16:46:08,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:08,255 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-16 16:46:08,288 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-16 16:46:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:08,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:46:08,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:08,384 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:46:08,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:08,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020370375] [2023-12-16 16:46:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020370375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:46:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:46:08,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:46:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265622730] [2023-12-16 16:46:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:46:08,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:46:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:08,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:46:08,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:46:08,387 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:08,425 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2023-12-16 16:46:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:46:08,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 16:46:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:08,429 INFO L225 Difference]: With dead ends: 40 [2023-12-16 16:46:08,429 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 16:46:08,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:46:08,430 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:08,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:46:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 16:46:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-12-16 16:46:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 16:46:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2023-12-16 16:46:08,438 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 12 [2023-12-16 16:46:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:08,438 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2023-12-16 16:46:08,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2023-12-16 16:46:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:46:08,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:08,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:08,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:46:08,645 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-16 16:46:08,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:08,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:08,646 INFO L85 PathProgramCache]: Analyzing trace with hash -19548978, now seen corresponding path program 1 times [2023-12-16 16:46:08,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:08,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125275146] [2023-12-16 16:46:08,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:08,647 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-16 16:46:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:08,648 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-16 16:46:08,650 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-16 16:46:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:08,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:46:08,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:08,951 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:46:08,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:08,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125275146] [2023-12-16 16:46:08,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125275146] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:46:08,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:46:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 16:46:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514257820] [2023-12-16 16:46:08,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:46:08,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:46:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:08,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:46:08,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:46:08,958 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:12,564 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2023-12-16 16:46:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:46:12,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 16:46:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:12,577 INFO L225 Difference]: With dead ends: 63 [2023-12-16 16:46:12,577 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 16:46:12,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:46:12,578 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:12,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 185 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-16 16:46:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 16:46:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-16 16:46:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 16:46:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2023-12-16 16:46:12,592 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 12 [2023-12-16 16:46:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:12,592 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2023-12-16 16:46:12,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2023-12-16 16:46:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 16:46:12,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:12,593 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:12,596 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-16 16:46:12,795 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-16 16:46:12,796 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:12,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1459140795, now seen corresponding path program 1 times [2023-12-16 16:46:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:12,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982858846] [2023-12-16 16:46:12,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:12,797 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-16 16:46:12,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:12,799 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-16 16:46:12,804 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-16 16:46:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:12,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:46:12,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:12,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:46:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:13,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:13,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982858846] [2023-12-16 16:46:13,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982858846] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:46:13,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:46:13,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 16:46:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981326823] [2023-12-16 16:46:13,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:46:13,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:46:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:13,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:46:13,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:46:13,111 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:18,726 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2023-12-16 16:46:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 16:46:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-16 16:46:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:18,735 INFO L225 Difference]: With dead ends: 95 [2023-12-16 16:46:18,736 INFO L226 Difference]: Without dead ends: 76 [2023-12-16 16:46:18,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:46:18,737 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 46 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:18,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 190 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-12-16 16:46:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-16 16:46:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2023-12-16 16:46:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 16:46:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2023-12-16 16:46:18,751 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 14 [2023-12-16 16:46:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:18,751 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2023-12-16 16:46:18,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2023-12-16 16:46:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:46:18,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:18,752 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:18,763 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-16 16:46:18,957 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-16 16:46:18,957 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:18,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1670178699, now seen corresponding path program 1 times [2023-12-16 16:46:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:18,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526850864] [2023-12-16 16:46:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:18,958 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-16 16:46:18,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:18,959 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-16 16:46:18,960 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-16 16:46:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:19,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:46:19,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:19,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:46:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:19,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526850864] [2023-12-16 16:46:19,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526850864] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:46:19,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:46:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 16:46:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773667393] [2023-12-16 16:46:19,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:46:19,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:46:19,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:19,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:46:19,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:46:19,351 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:29,828 INFO L93 Difference]: Finished difference Result 129 states and 183 transitions. [2023-12-16 16:46:29,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 16:46:29,843 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 16:46:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:29,844 INFO L225 Difference]: With dead ends: 129 [2023-12-16 16:46:29,844 INFO L226 Difference]: Without dead ends: 120 [2023-12-16 16:46:29,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:46:29,845 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 110 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:29,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 215 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2023-12-16 16:46:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-16 16:46:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2023-12-16 16:46:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.360655737704918) internal successors, (83), 66 states have internal predecessors, (83), 43 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 16:46:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 164 transitions. [2023-12-16 16:46:29,871 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 164 transitions. Word has length 15 [2023-12-16 16:46:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:29,871 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 164 transitions. [2023-12-16 16:46:29,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 164 transitions. [2023-12-16 16:46:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:46:29,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:29,876 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:29,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:46:30,083 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-16 16:46:30,084 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:30,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1671668249, now seen corresponding path program 1 times [2023-12-16 16:46:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:30,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333258240] [2023-12-16 16:46:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:30,085 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-16 16:46:30,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:30,086 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-16 16:46:30,087 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-16 16:46:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:30,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:46:30,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:30,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:46:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:31,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333258240] [2023-12-16 16:46:31,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333258240] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:46:31,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:46:31,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-12-16 16:46:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002896285] [2023-12-16 16:46:31,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:46:31,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:46:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:31,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:46:31,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:46:31,121 INFO L87 Difference]: Start difference. First operand 111 states and 164 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:37,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 16:46:41,304 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-16 16:46:46,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 16:46:50,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 16:46:58,204 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-16 16:47:02,208 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-16 16:47:06,648 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-16 16:47:10,650 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-16 16:47:15,248 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-16 16:47:19,250 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-16 16:47:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:19,252 INFO L93 Difference]: Finished difference Result 202 states and 303 transitions. [2023-12-16 16:47:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:47:19,266 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 16:47:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:19,268 INFO L225 Difference]: With dead ends: 202 [2023-12-16 16:47:19,268 INFO L226 Difference]: Without dead ends: 156 [2023-12-16 16:47:19,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:47:19,270 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 127 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:19,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 280 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 227 Invalid, 9 Unknown, 0 Unchecked, 47.6s Time] [2023-12-16 16:47:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-16 16:47:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2023-12-16 16:47:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 84 states have internal predecessors, (98), 50 states have call successors, (50), 9 states have call predecessors, (50), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 16:47:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2023-12-16 16:47:19,296 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 15 [2023-12-16 16:47:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:19,297 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2023-12-16 16:47:19,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:47:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2023-12-16 16:47:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 16:47:19,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:19,298 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:19,306 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-16 16:47:19,500 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-16 16:47:19,501 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:19,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1600243630, now seen corresponding path program 1 times [2023-12-16 16:47:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:19,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131042360] [2023-12-16 16:47:19,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:19,502 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-16 16:47:19,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:19,503 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-16 16:47:19,504 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-16 16:47:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:19,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:47:19,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:47:19,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:47:19,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:19,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131042360] [2023-12-16 16:47:19,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131042360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:47:19,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:47:19,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:47:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257628260] [2023-12-16 16:47:19,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:19,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:47:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:19,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:47:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:47:19,795 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:47:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:21,554 INFO L93 Difference]: Finished difference Result 195 states and 275 transitions. [2023-12-16 16:47:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:47:21,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-12-16 16:47:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:21,575 INFO L225 Difference]: With dead ends: 195 [2023-12-16 16:47:21,575 INFO L226 Difference]: Without dead ends: 168 [2023-12-16 16:47:21,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:47:21,576 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:21,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 112 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 16:47:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-16 16:47:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-12-16 16:47:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 97 states have internal predecessors, (113), 65 states have call successors, (65), 12 states have call predecessors, (65), 12 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2023-12-16 16:47:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 237 transitions. [2023-12-16 16:47:21,627 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 237 transitions. Word has length 22 [2023-12-16 16:47:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:21,627 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 237 transitions. [2023-12-16 16:47:21,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:47:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 237 transitions. [2023-12-16 16:47:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:47:21,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:21,631 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:21,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:47:21,840 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-16 16:47:21,841 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:21,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:21,841 INFO L85 PathProgramCache]: Analyzing trace with hash 770870963, now seen corresponding path program 1 times [2023-12-16 16:47:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:21,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270734258] [2023-12-16 16:47:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:21,841 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-16 16:47:21,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:21,842 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-16 16:47:21,843 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-16 16:47:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:21,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 16:47:21,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:22,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-16 16:47:23,296 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 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:47:23,301 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-16 16:47:23,346 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:47:23,350 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-16 16:47:23,547 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-16 16:47:23,547 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. [2023-12-16 16:47:23,551 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:23,554 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:47:23,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:47:23 BoogieIcfgContainer [2023-12-16 16:47:23,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:47:23,558 INFO L158 Benchmark]: Toolchain (without parser) took 77011.31ms. Allocated memory was 195.0MB in the beginning and 255.9MB in the end (delta: 60.8MB). Free memory was 148.6MB in the beginning and 180.4MB in the end (delta: -31.8MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. [2023-12-16 16:47:23,558 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 195.0MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:47:23,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.68ms. Allocated memory is still 195.0MB. Free memory was 148.2MB in the beginning and 135.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 16:47:23,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.02ms. Allocated memory is still 195.0MB. Free memory was 135.6MB in the beginning and 133.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 16:47:23,559 INFO L158 Benchmark]: Boogie Preprocessor took 42.15ms. Allocated memory is still 195.0MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:47:23,560 INFO L158 Benchmark]: RCFGBuilder took 430.77ms. Allocated memory is still 195.0MB. Free memory was 131.8MB in the beginning and 114.7MB in the end (delta: 17.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 16:47:23,560 INFO L158 Benchmark]: TraceAbstraction took 76236.24ms. Allocated memory was 195.0MB in the beginning and 255.9MB in the end (delta: 60.8MB). Free memory was 114.0MB in the beginning and 180.4MB in the end (delta: -66.4MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:47:23,562 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.17ms. Allocated memory is still 195.0MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.68ms. Allocated memory is still 195.0MB. Free memory was 148.2MB in the beginning and 135.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.02ms. Allocated memory is still 195.0MB. Free memory was 135.6MB in the beginning and 133.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.15ms. Allocated memory is still 195.0MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 430.77ms. Allocated memory is still 195.0MB. Free memory was 131.8MB in the beginning and 114.7MB in the end (delta: 17.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 76236.24ms. Allocated memory was 195.0MB in the beginning and 255.9MB in the end (delta: 60.8MB). Free memory was 114.0MB in the beginning and 180.4MB in the end (delta: -66.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14). Cancelled while NwaCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.2s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 69.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 68.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 1246 SdHoareTripleChecker+Invalid, 65.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 947 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 617 IncrementalHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 299 mSDtfsCounter, 617 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=8, InterpolantAutomatonStates: 64, 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, 8 MinimizatonAttempts, 51 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 624 SizeOfPredicates, 13 NumberOfNonLiveVariables, 286 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 8/24 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