/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/loops-crafted-1/mono-crafted_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:35:48,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:35:48,068 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:35:48,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:35:48,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:35:48,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:35:48,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:35:48,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:35:48,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:35:48,099 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:35:48,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:35:48,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:35:48,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:35:48,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:35:48,107 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:35:48,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:35:48,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:35:48,109 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:35:48,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:35:48,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:35:48,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:35:48,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:35:48,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:35:48,110 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:35:48,110 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:35:48,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:35:48,110 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:35:48,110 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:35:48,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:35:48,111 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:35:48,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:35:48,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:35:48,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:35:48,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:35:48,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:35:48,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:35:48,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:35:48,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:35:48,112 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:35:48,113 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:35:48,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:35:48,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:35:48,113 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:35:48,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:35:48,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:35:48,114 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:35:48,114 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:35:48,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:35:48,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:35:48,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:35:48,317 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:35:48,317 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:35:48,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c [2023-12-16 16:35:49,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:35:49,477 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:35:49,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c [2023-12-16 16:35:49,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60231abbf/335999cc186944269eca6af89b7e4b3e/FLAG56bc19364 [2023-12-16 16:35:49,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60231abbf/335999cc186944269eca6af89b7e4b3e [2023-12-16 16:35:49,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:35:49,494 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:35:49,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:35:49,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:35:49,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:35:49,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191c6991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49, skipping insertion in model container [2023-12-16 16:35:49,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,515 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:35:49,611 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c[318,331] [2023-12-16 16:35:49,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:35:49,627 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:35:49,635 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c[318,331] [2023-12-16 16:35:49,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:35:49,647 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:35:49,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49 WrapperNode [2023-12-16 16:35:49,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:35:49,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:35:49,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:35:49,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:35:49,653 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:35:49" (1/1) ... [2023-12-16 16:35:49,657 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:35:49" (1/1) ... [2023-12-16 16:35:49,667 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2023-12-16 16:35:49,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:35:49,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:35:49,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:35:49,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:35:49,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,682 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:35:49,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:35:49,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:35:49,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:35:49,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:35:49,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (1/1) ... [2023-12-16 16:35:49,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:35:49,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:35:49,711 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:35:49,714 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:35:49,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:35:49,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:35:49,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:35:49,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:35:49,774 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:35:49,775 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:35:49,858 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:35:49,876 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:35:49,876 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 16:35:49,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:35:49 BoogieIcfgContainer [2023-12-16 16:35:49,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:35:49,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:35:49,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:35:49,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:35:49,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:35:49" (1/3) ... [2023-12-16 16:35:49,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5110532a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:35:49, skipping insertion in model container [2023-12-16 16:35:49,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:49" (2/3) ... [2023-12-16 16:35:49,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5110532a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:35:49, skipping insertion in model container [2023-12-16 16:35:49,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:35:49" (3/3) ... [2023-12-16 16:35:49,882 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_6.c [2023-12-16 16:35:49,893 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:35:49,893 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:35:49,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:35:49,930 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;@458b4edd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:35:49,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:35:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-16 16:35:49,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:35:49,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-16 16:35:49,941 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:35:49,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:35:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash 68636575, now seen corresponding path program 1 times [2023-12-16 16:35:49,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:35:49,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652730747] [2023-12-16 16:35:49,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:35:49,954 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:35:49,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:35:49,956 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:35:49,957 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:35:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:35:50,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:35:50,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:35:50,048 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:35:50,048 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:35:50,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:35:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652730747] [2023-12-16 16:35:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652730747] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:35:50,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:35:50,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:35:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750544657] [2023-12-16 16:35:50,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:35:50,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:35:50,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:35:50,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:35:50,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:35:50,072 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:35:50,098 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2023-12-16 16:35:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:35:50,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-16 16:35:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:35:50,104 INFO L225 Difference]: With dead ends: 23 [2023-12-16 16:35:50,104 INFO L226 Difference]: Without dead ends: 11 [2023-12-16 16:35:50,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:35:50,108 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:35:50,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 13 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:35:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-16 16:35:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-16 16:35:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-16 16:35:50,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2023-12-16 16:35:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:35:50,132 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-16 16:35:50,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-16 16:35:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 16:35:50,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:35:50,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:35:50,137 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:35:50,335 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:35:50,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:35:50,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:35:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1578908930, now seen corresponding path program 1 times [2023-12-16 16:35:50,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:35:50,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514913479] [2023-12-16 16:35:50,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:35:50,337 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:35:50,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:35:50,378 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:35:50,382 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:35:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:35:50,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:35:50,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:35:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:35:50,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:35:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:35:50,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:35:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514913479] [2023-12-16 16:35:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514913479] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:35:50,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:35:50,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 16:35:50,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229891575] [2023-12-16 16:35:50,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:35:50,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:35:50,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:35:50,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:35:50,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:35:50,499 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:35:50,561 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2023-12-16 16:35:50,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:35:50,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 16:35:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:35:50,563 INFO L225 Difference]: With dead ends: 25 [2023-12-16 16:35:50,563 INFO L226 Difference]: Without dead ends: 17 [2023-12-16 16:35:50,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:35:50,566 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:35:50,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 13 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:35:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-16 16:35:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2023-12-16 16:35:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-16 16:35:50,577 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 7 [2023-12-16 16:35:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:35:50,577 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-16 16:35:50,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-16 16:35:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 16:35:50,578 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:35:50,578 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:35:50,582 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:35:50,778 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:35:50,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:35:50,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:35:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash -266815252, now seen corresponding path program 1 times [2023-12-16 16:35:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:35:50,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039725601] [2023-12-16 16:35:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:35:50,780 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:35:50,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:35:50,781 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:35:50,785 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:35:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:35:50,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:35:50,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:35:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:35:50,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:35:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:35:50,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:35:50,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039725601] [2023-12-16 16:35:50,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039725601] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:35:50,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:35:50,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 16:35:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883628020] [2023-12-16 16:35:50,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:35:50,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:35:50,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:35:50,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:35:50,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:35:50,909 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:35:50,995 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-12-16 16:35:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:35:50,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 16:35:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:35:50,996 INFO L225 Difference]: With dead ends: 33 [2023-12-16 16:35:50,996 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 16:35:50,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:35:50,999 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:35:51,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:35:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 16:35:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-16 16:35:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-12-16 16:35:51,007 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 13 [2023-12-16 16:35:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:35:51,007 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-12-16 16:35:51,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-12-16 16:35:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 16:35:51,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:35:51,008 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:35:51,012 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:35:51,210 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:35:51,210 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:35:51,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:35:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash 205166072, now seen corresponding path program 2 times [2023-12-16 16:35:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:35:51,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846214155] [2023-12-16 16:35:51,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:35:51,211 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:35:51,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:35:51,216 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:35:51,217 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:35:51,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:35:51,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:35:51,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 16:35:51,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:35:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:35:51,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:35:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:35:51,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:35:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846214155] [2023-12-16 16:35:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846214155] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:35:51,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:35:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-16 16:35:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311321493] [2023-12-16 16:35:51,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:35:51,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 16:35:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:35:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 16:35:51,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:35:51,542 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:35:51,837 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-12-16 16:35:51,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:35:51,837 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-16 16:35:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:35:51,838 INFO L225 Difference]: With dead ends: 49 [2023-12-16 16:35:51,838 INFO L226 Difference]: Without dead ends: 39 [2023-12-16 16:35:51,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:35:51,839 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:35:51,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:35:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-16 16:35:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-16 16:35:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-12-16 16:35:51,844 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 21 [2023-12-16 16:35:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:35:51,844 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-12-16 16:35:51,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2023-12-16 16:35:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 16:35:51,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:35:51,845 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:35:51,851 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:35:52,047 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:35:52,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:35:52,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:35:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1524438000, now seen corresponding path program 3 times [2023-12-16 16:35:52,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:35:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002950342] [2023-12-16 16:35:52,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:35:52,049 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:35:52,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:35:52,050 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:35:52,051 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:35:52,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 16:35:52,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:35:52,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:35:52,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:35:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-12-16 16:35:52,117 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:35:52,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:35:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002950342] [2023-12-16 16:35:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002950342] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:35:52,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:35:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:35:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065130202] [2023-12-16 16:35:52,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:35:52,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:35:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:35:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:35:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:35:52,119 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:35:52,148 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2023-12-16 16:35:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:35:52,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-16 16:35:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:35:52,149 INFO L225 Difference]: With dead ends: 52 [2023-12-16 16:35:52,150 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 16:35:52,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:35:52,150 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:35:52,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:35:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 16:35:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-16 16:35:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2023-12-16 16:35:52,169 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 37 [2023-12-16 16:35:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:35:52,169 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2023-12-16 16:35:52,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2023-12-16 16:35:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 16:35:52,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:35:52,170 INFO L195 NwaCegarLoop]: trace histogram [16, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:35:52,180 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:35:52,374 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:35:52,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:35:52,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:35:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1652934759, now seen corresponding path program 1 times [2023-12-16 16:35:52,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:35:52,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429308979] [2023-12-16 16:35:52,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:35:52,375 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:35:52,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:35:52,379 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:35:52,380 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:35:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:35:52,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-16 16:35:52,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:35:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:35:52,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:35:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:35:53,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:35:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429308979] [2023-12-16 16:35:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429308979] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:35:53,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:35:53,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-12-16 16:35:53,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899182123] [2023-12-16 16:35:53,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:35:53,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-16 16:35:53,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:35:53,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-16 16:35:53,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2023-12-16 16:35:53,152 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 32 states, 32 states have (on average 2.21875) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:35:54,851 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2023-12-16 16:35:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-16 16:35:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-16 16:35:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:35:54,853 INFO L225 Difference]: With dead ends: 87 [2023-12-16 16:35:54,853 INFO L226 Difference]: Without dead ends: 74 [2023-12-16 16:35:54,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2023-12-16 16:35:54,854 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:35:54,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:35:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-16 16:35:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-12-16 16:35:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2023-12-16 16:35:54,862 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 41 [2023-12-16 16:35:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:35:54,862 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2023-12-16 16:35:54,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:35:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2023-12-16 16:35:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-16 16:35:54,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:35:54,865 INFO L195 NwaCegarLoop]: trace histogram [32, 30, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:35:54,874 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:35:55,068 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:35:55,068 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:35:55,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:35:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1058817079, now seen corresponding path program 2 times [2023-12-16 16:35:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:35:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234063106] [2023-12-16 16:35:55,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:35:55,070 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:35:55,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:35:55,071 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:35:55,077 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:35:55,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:35:55,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:35:55,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-16 16:35:55,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:35:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:35:55,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:35:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:35:57,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:35:57,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234063106] [2023-12-16 16:35:57,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234063106] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:35:57,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:35:57,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2023-12-16 16:35:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632884187] [2023-12-16 16:35:57,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:35:57,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-12-16 16:35:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:35:57,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-12-16 16:35:57,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2946, Unknown=0, NotChecked=0, Total=4032 [2023-12-16 16:35:57,469 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 64 states, 64 states have (on average 2.109375) internal successors, (135), 63 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:36:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:36:11,035 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2023-12-16 16:36:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-12-16 16:36:11,035 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.109375) internal successors, (135), 63 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2023-12-16 16:36:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:36:11,036 INFO L225 Difference]: With dead ends: 151 [2023-12-16 16:36:11,036 INFO L226 Difference]: Without dead ends: 138 [2023-12-16 16:36:11,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=3006, Invalid=5736, Unknown=0, NotChecked=0, Total=8742 [2023-12-16 16:36:11,038 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:36:11,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 16:36:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-16 16:36:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2023-12-16 16:36:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:36:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2023-12-16 16:36:11,050 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 73 [2023-12-16 16:36:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:36:11,050 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2023-12-16 16:36:11,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.109375) internal successors, (135), 63 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:36:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2023-12-16 16:36:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 16:36:11,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:36:11,052 INFO L195 NwaCegarLoop]: trace histogram [64, 62, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:36:11,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 16:36:11,255 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:36:11,255 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:36:11,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:36:11,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2128643113, now seen corresponding path program 3 times [2023-12-16 16:36:11,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:36:11,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850704239] [2023-12-16 16:36:11,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:36:11,257 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:36:11,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:36:11,258 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:36:11,259 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:36:11,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 16:36:11,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:36:11,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:36:11,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:36:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 190 proven. 2 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2023-12-16 16:36:11,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:36:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 190 proven. 2 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2023-12-16 16:36:11,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:36:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850704239] [2023-12-16 16:36:11,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850704239] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:36:11,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:36:11,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 16:36:11,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993207331] [2023-12-16 16:36:11,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:36:11,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:36:11,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:36:11,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:36:11,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:36:11,446 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:36:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:36:11,577 INFO L93 Difference]: Finished difference Result 163 states and 178 transitions. [2023-12-16 16:36:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:36:11,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2023-12-16 16:36:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:36:11,578 INFO L225 Difference]: With dead ends: 163 [2023-12-16 16:36:11,578 INFO L226 Difference]: Without dead ends: 150 [2023-12-16 16:36:11,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:36:11,579 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:36:11,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 13 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:36:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-16 16:36:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-12-16 16:36:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:36:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2023-12-16 16:36:11,591 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 137 [2023-12-16 16:36:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:36:11,592 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2023-12-16 16:36:11,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:36:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2023-12-16 16:36:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-16 16:36:11,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:36:11,593 INFO L195 NwaCegarLoop]: trace histogram [67, 62, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2023-12-16 16:36:11,601 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:36:11,795 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:36:11,795 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:36:11,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:36:11,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1133624702, now seen corresponding path program 4 times [2023-12-16 16:36:11,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:36:11,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819618126] [2023-12-16 16:36:11,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:36:11,796 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:36:11,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:36:11,797 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:36:11,798 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:36:11,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:36:11,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:36:11,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 126 conjunts are in the unsatisfiable core [2023-12-16 16:36:11,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:36:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4509 backedges. 567 proven. 3906 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-16 16:36:13,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:36:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4509 backedges. 567 proven. 3906 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-16 16:36:21,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:36:21,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819618126] [2023-12-16 16:36:21,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819618126] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:36:21,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:36:21,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 127 [2023-12-16 16:36:21,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956948945] [2023-12-16 16:36:21,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:36:21,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2023-12-16 16:36:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:36:21,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2023-12-16 16:36:21,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4222, Invalid=12034, Unknown=0, NotChecked=0, Total=16256 [2023-12-16 16:36:21,160 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand has 128 states, 128 states have (on average 2.0546875) internal successors, (263), 127 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 16:37:08,115 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:37:08,115 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:37:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-12-16 16:37:08,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 52.2s TimeCoverageRelationStatistics Valid=6526, Invalid=14644, Unknown=0, NotChecked=0, Total=21170 [2023-12-16 16:37:08,126 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8037 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:37:08,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 8038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8037 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-16 16:37:08,127 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:37:08,137 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:37:08,328 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:37:08,328 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (150states) and FLOYD_HOARE automaton (currently 83 states, 128 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 146 known predicates. [2023-12-16 16:37:08,332 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1] [2023-12-16 16:37:08,333 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:37:08,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:37:08 BoogieIcfgContainer [2023-12-16 16:37:08,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:37:08,335 INFO L158 Benchmark]: Toolchain (without parser) took 78841.09ms. Allocated memory was 268.4MB in the beginning and 346.0MB in the end (delta: 77.6MB). Free memory was 228.0MB in the beginning and 296.1MB in the end (delta: -68.1MB). Peak memory consumption was 197.2MB. Max. memory is 8.0GB. [2023-12-16 16:37:08,335 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory was 135.9MB in the beginning and 135.7MB in the end (delta: 180.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:37:08,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.57ms. Allocated memory is still 268.4MB. Free memory was 228.0MB in the beginning and 217.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 16:37:08,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.28ms. Allocated memory is still 268.4MB. Free memory was 217.0MB in the beginning and 215.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:37:08,335 INFO L158 Benchmark]: Boogie Preprocessor took 21.20ms. Allocated memory is still 268.4MB. Free memory was 215.4MB in the beginning and 213.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 16:37:08,336 INFO L158 Benchmark]: RCFGBuilder took 186.76ms. Allocated memory is still 268.4MB. Free memory was 213.8MB in the beginning and 201.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 16:37:08,336 INFO L158 Benchmark]: TraceAbstraction took 78456.66ms. Allocated memory was 268.4MB in the beginning and 346.0MB in the end (delta: 77.6MB). Free memory was 201.2MB in the beginning and 296.1MB in the end (delta: -94.9MB). Peak memory consumption was 171.0MB. Max. memory is 8.0GB. [2023-12-16 16:37:08,337 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.13ms. Allocated memory is still 183.5MB. Free memory was 135.9MB in the beginning and 135.7MB in the end (delta: 180.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 152.57ms. Allocated memory is still 268.4MB. Free memory was 228.0MB in the beginning and 217.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.28ms. Allocated memory is still 268.4MB. Free memory was 217.0MB in the beginning and 215.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.20ms. Allocated memory is still 268.4MB. Free memory was 215.4MB in the beginning and 213.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 186.76ms. Allocated memory is still 268.4MB. Free memory was 213.8MB in the beginning and 201.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 78456.66ms. Allocated memory was 268.4MB in the beginning and 346.0MB in the end (delta: 77.6MB). Free memory was 201.2MB in the beginning and 296.1MB in the end (delta: -94.9MB). Peak memory consumption was 171.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4). Cancelled while NwaCegarLoop was constructing difference of abstraction (150states) and FLOYD_HOARE automaton (currently 83 states, 128 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 146 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 78.4s, OverallIterations: 9, TraceHistogramMax: 67, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 62.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11083 IncrementalHoareTripleChecker+Invalid, 11115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 56 mSDtfsCounter, 11083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 986 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 69.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=8, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 483 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 2450 SizeOfPredicates, 117 NumberOfNonLiveVariables, 722 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 9931/20125 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