/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:00:57,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:00:57,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 01:00:57,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:00:57,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:00:57,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:00:57,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:00:57,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:00:57,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:00:57,460 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:00:57,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:00:57,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:00:57,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:00:57,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:00:57,463 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:00:57,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:00:57,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:00:57,464 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:00:57,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:00:57,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:00:57,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:00:57,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:00:57,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:00:57,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:00:57,465 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:00:57,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:00:57,465 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:00:57,466 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:00:57,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:00:57,466 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:00:57,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:00:57,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:00:57,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:00:57,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:00:57,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:00:57,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:00:57,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:00:57,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:00:57,468 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:00:57,468 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:00:57,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:00:57,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:00:57,468 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:00:57,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:00:57,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:00:57,469 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:00:57,469 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 01:00:57,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:00:57,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:00:57,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:00:57,659 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:00:57,659 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:00:57,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2023-12-25 01:00:58,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:00:58,837 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:00:58,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2023-12-25 01:00:58,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca32dc330/e0f24af57c574a19876a6fb8b1e7a72b/FLAG34b2ba784 [2023-12-25 01:00:58,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca32dc330/e0f24af57c574a19876a6fb8b1e7a72b [2023-12-25 01:00:58,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:00:58,855 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:00:58,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:00:58,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:00:58,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:00:58,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:00:58" (1/1) ... [2023-12-25 01:00:58,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30006564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:58, skipping insertion in model container [2023-12-25 01:00:58,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:00:58" (1/1) ... [2023-12-25 01:00:58,883 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:00:58,998 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c[525,538] [2023-12-25 01:00:59,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:00:59,036 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:00:59,044 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c[525,538] [2023-12-25 01:00:59,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:00:59,064 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:00:59,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59 WrapperNode [2023-12-25 01:00:59,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:00:59,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:00:59,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:00:59,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:00:59,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,089 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-12-25 01:00:59,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:00:59,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:00:59,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:00:59,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:00:59,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,108 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 01:00:59,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:00:59,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:00:59,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:00:59,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:00:59,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (1/1) ... [2023-12-25 01:00:59,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:00:59,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:00:59,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 01:00:59,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 01:00:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:00:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:00:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:00:59,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:00:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:00:59,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:00:59,243 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:00:59,246 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:00:59,454 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:00:59,490 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:00:59,490 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 01:00:59,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:00:59 BoogieIcfgContainer [2023-12-25 01:00:59,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:00:59,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:00:59,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:00:59,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:00:59,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:00:58" (1/3) ... [2023-12-25 01:00:59,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5da76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:00:59, skipping insertion in model container [2023-12-25 01:00:59,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:00:59" (2/3) ... [2023-12-25 01:00:59,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5da76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:00:59, skipping insertion in model container [2023-12-25 01:00:59,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:00:59" (3/3) ... [2023-12-25 01:00:59,497 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound20.c [2023-12-25 01:00:59,508 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:00:59,509 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:00:59,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:00:59,556 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;@aa57ca9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:00:59,556 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:00:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 01:00:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 01:00:59,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:00:59,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:00:59,567 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:00:59,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:00:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2020981481, now seen corresponding path program 1 times [2023-12-25 01:00:59,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:00:59,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621861028] [2023-12-25 01:00:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:00:59,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:00:59,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:00:59,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:00:59,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 01:00:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:00:59,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:00:59,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:00:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:00:59,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:00:59,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:00:59,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621861028] [2023-12-25 01:00:59,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621861028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:00:59,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:00:59,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:00:59,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571246430] [2023-12-25 01:00:59,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:00:59,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:00:59,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:00:59,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:00:59,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:00:59,724 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:00:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:00:59,742 INFO L93 Difference]: Finished difference Result 52 states and 92 transitions. [2023-12-25 01:00:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:00:59,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-25 01:00:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:00:59,749 INFO L225 Difference]: With dead ends: 52 [2023-12-25 01:00:59,749 INFO L226 Difference]: Without dead ends: 25 [2023-12-25 01:00:59,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:00:59,753 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:00:59,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:00:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-25 01:00:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-25 01:00:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:00:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2023-12-25 01:00:59,776 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 9 [2023-12-25 01:00:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:00:59,777 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2023-12-25 01:00:59,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:00:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2023-12-25 01:00:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-25 01:00:59,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:00:59,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:00:59,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 01:00:59,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:00:59,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:00:59,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:00:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash 10324464, now seen corresponding path program 1 times [2023-12-25 01:00:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:00:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688714916] [2023-12-25 01:00:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:00:59,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:00:59,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:00:59,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:00:59,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:01:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:01:00,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 01:01:00,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:01:00,117 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:01:00,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:01:00,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688714916] [2023-12-25 01:01:00,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688714916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:01:00,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:01:00,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 01:01:00,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348261349] [2023-12-25 01:01:00,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:01:00,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 01:01:00,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:01:00,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 01:01:00,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 01:01:00,120 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:00,145 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-12-25 01:01:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 01:01:00,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-25 01:01:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:00,147 INFO L225 Difference]: With dead ends: 46 [2023-12-25 01:01:00,148 INFO L226 Difference]: Without dead ends: 27 [2023-12-25 01:01:00,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 01:01:00,151 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:00,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:01:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-25 01:01:00,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-25 01:01:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:01:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2023-12-25 01:01:00,165 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 11 [2023-12-25 01:01:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:00,165 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2023-12-25 01:01:00,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2023-12-25 01:01:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-25 01:01:00,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:00,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:00,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 01:01:00,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:00,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:00,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash -21038528, now seen corresponding path program 1 times [2023-12-25 01:01:00,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:00,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850320257] [2023-12-25 01:01:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:01:00,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:00,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:00,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:01:00,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:01:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:01:00,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:01:00,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:01:00,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:01:00,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:01:00,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850320257] [2023-12-25 01:01:00,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850320257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:01:00,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:01:00,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 01:01:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923774356] [2023-12-25 01:01:00,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:01:00,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:01:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:01:00,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:01:00,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:01:00,531 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:00,550 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2023-12-25 01:01:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:01:00,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-25 01:01:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:00,555 INFO L225 Difference]: With dead ends: 40 [2023-12-25 01:01:00,555 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 01:01:00,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:01:00,561 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:00,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:01:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 01:01:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-12-25 01:01:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:01:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2023-12-25 01:01:00,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 12 [2023-12-25 01:01:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:00,570 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2023-12-25 01:01:00,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2023-12-25 01:01:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-25 01:01:00,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:00,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:00,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 01:01:00,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:00,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:00,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash -19548978, now seen corresponding path program 1 times [2023-12-25 01:01:00,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:00,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16536862] [2023-12-25 01:01:00,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:01:00,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:00,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:00,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:01:00,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 01:01:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:01:00,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 01:01:00,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:01:01,107 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:01:01,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:01:01,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16536862] [2023-12-25 01:01:01,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16536862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:01:01,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:01:01,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 01:01:01,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742248538] [2023-12-25 01:01:01,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:01:01,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:01:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:01:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:01:01,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:01:01,111 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:04,686 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2023-12-25 01:01:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:01:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-25 01:01:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:04,700 INFO L225 Difference]: With dead ends: 63 [2023-12-25 01:01:04,700 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 01:01:04,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 01:01:04,701 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:04,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 185 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-25 01:01:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 01:01:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-25 01:01:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 01:01:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2023-12-25 01:01:04,717 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 12 [2023-12-25 01:01:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:04,717 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2023-12-25 01:01:04,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2023-12-25 01:01:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 01:01:04,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:04,718 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:04,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 01:01:04,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:04,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:04,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1459140795, now seen corresponding path program 1 times [2023-12-25 01:01:04,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:04,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976742496] [2023-12-25 01:01:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:01:04,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:04,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:04,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:01:04,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 01:01:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:01:04,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:01:04,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:01:05,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:01:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:01:05,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:01:05,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976742496] [2023-12-25 01:01:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976742496] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:01:05,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:01:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-25 01:01:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349541560] [2023-12-25 01:01:05,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:01:05,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:01:05,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:01:05,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:01:05,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:01:05,202 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:09,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:12,385 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2023-12-25 01:01:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 01:01:12,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-25 01:01:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:12,394 INFO L225 Difference]: With dead ends: 95 [2023-12-25 01:01:12,394 INFO L226 Difference]: Without dead ends: 76 [2023-12-25 01:01:12,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:01:12,395 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 46 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:12,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 190 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-12-25 01:01:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-25 01:01:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2023-12-25 01:01:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 01:01:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2023-12-25 01:01:12,414 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 14 [2023-12-25 01:01:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:12,416 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2023-12-25 01:01:12,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2023-12-25 01:01:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 01:01:12,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:12,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:12,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 01:01:12,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:12,618 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:12,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1670178699, now seen corresponding path program 1 times [2023-12-25 01:01:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:12,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460883009] [2023-12-25 01:01:12,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:01:12,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:12,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:12,621 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:01:12,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 01:01:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:01:12,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:01:12,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:01:12,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:01:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:01:12,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:01:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460883009] [2023-12-25 01:01:12,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460883009] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:01:12,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:01:12,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 01:01:12,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028544909] [2023-12-25 01:01:12,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:01:12,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 01:01:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:01:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 01:01:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:01:12,952 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:24,706 INFO L93 Difference]: Finished difference Result 129 states and 183 transitions. [2023-12-25 01:01:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 01:01:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-25 01:01:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:24,720 INFO L225 Difference]: With dead ends: 129 [2023-12-25 01:01:24,720 INFO L226 Difference]: Without dead ends: 120 [2023-12-25 01:01:24,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-25 01:01:24,721 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 110 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:24,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 215 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2023-12-25 01:01:24,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-25 01:01:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2023-12-25 01:01:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.360655737704918) internal successors, (83), 66 states have internal predecessors, (83), 43 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-25 01:01:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 164 transitions. [2023-12-25 01:01:24,745 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 164 transitions. Word has length 15 [2023-12-25 01:01:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:24,745 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 164 transitions. [2023-12-25 01:01:24,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 164 transitions. [2023-12-25 01:01:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 01:01:24,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:24,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:24,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 01:01:24,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:24,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:24,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:24,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1671668249, now seen corresponding path program 1 times [2023-12-25 01:01:24,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:24,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401292111] [2023-12-25 01:01:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:01:24,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:01:24,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:24,963 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:01:24,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 01:01:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:01:24,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:01:24,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:01:25,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:01:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:01:25,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:01:25,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401292111] [2023-12-25 01:01:25,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401292111] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:01:25,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:01:25,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-12-25 01:01:25,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791563126] [2023-12-25 01:01:25,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:01:25,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:01:25,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:01:25,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:01:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:01:25,859 INFO L87 Difference]: Start difference. First operand 111 states and 164 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:01:31,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:35,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:41,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:45,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:53,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:57,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:02,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:06,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:11,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:15,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:02:15,092 INFO L93 Difference]: Finished difference Result 202 states and 303 transitions. [2023-12-25 01:02:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 01:02:15,107 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-25 01:02:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:02:15,109 INFO L225 Difference]: With dead ends: 202 [2023-12-25 01:02:15,109 INFO L226 Difference]: Without dead ends: 156 [2023-12-25 01:02:15,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:02:15,110 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 74 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 126 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:02:15,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 283 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 224 Invalid, 10 Unknown, 0 Unchecked, 48.7s Time] [2023-12-25 01:02:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-25 01:02:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2023-12-25 01:02:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 84 states have internal predecessors, (98), 50 states have call successors, (50), 9 states have call predecessors, (50), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-25 01:02:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2023-12-25 01:02:15,136 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 15 [2023-12-25 01:02:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:02:15,136 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2023-12-25 01:02:15,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:02:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2023-12-25 01:02:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 01:02:15,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:02:15,137 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:02:15,140 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-25 01:02:15,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:02:15,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:02:15,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:02:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1600243630, now seen corresponding path program 1 times [2023-12-25 01:02:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:02:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401709490] [2023-12-25 01:02:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:02:15,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:02:15,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:02:15,341 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:02:15,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 01:02:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:02:15,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:02:15,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:02:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:02:15,652 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:02:15,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:02:15,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401709490] [2023-12-25 01:02:15,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401709490] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:02:15,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:02:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 01:02:15,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98586730] [2023-12-25 01:02:15,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:02:15,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:02:15,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:02:15,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:02:15,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:02:15,654 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:02:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:02:17,431 INFO L93 Difference]: Finished difference Result 191 states and 272 transitions. [2023-12-25 01:02:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:02:17,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-12-25 01:02:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:02:17,451 INFO L225 Difference]: With dead ends: 191 [2023-12-25 01:02:17,451 INFO L226 Difference]: Without dead ends: 164 [2023-12-25 01:02:17,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 01:02:17,453 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:02:17,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 112 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 01:02:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-25 01:02:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-12-25 01:02:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 87 states have (on average 1.264367816091954) internal successors, (110), 94 states have internal predecessors, (110), 65 states have call successors, (65), 11 states have call predecessors, (65), 11 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2023-12-25 01:02:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 234 transitions. [2023-12-25 01:02:17,506 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 234 transitions. Word has length 22 [2023-12-25 01:02:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:02:17,506 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 234 transitions. [2023-12-25 01:02:17,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:02:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 234 transitions. [2023-12-25 01:02:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 01:02:17,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:02:17,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:02:17,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 01:02:17,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:02:17,720 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:02:17,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:02:17,721 INFO L85 PathProgramCache]: Analyzing trace with hash 770870963, now seen corresponding path program 1 times [2023-12-25 01:02:17,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:02:17,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794829215] [2023-12-25 01:02:17,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:02:17,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:02:17,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:02:17,723 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:02:17,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 01:02:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:02:17,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 01:02:17,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:02:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:02:18,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:02:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:02:24,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:02:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794829215] [2023-12-25 01:02:24,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794829215] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:02:24,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:02:24,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-25 01:02:24,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103835710] [2023-12-25 01:02:24,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:02:24,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 01:02:24,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:02:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 01:02:24,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-12-25 01:02:24,421 INFO L87 Difference]: Start difference. First operand 164 states and 234 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:02:36,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:40,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:45,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:49,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:53,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:57,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:02,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:06,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:17,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:21,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:26,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:30,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:36,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:40,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:03:40,091 INFO L93 Difference]: Finished difference Result 285 states and 420 transitions. [2023-12-25 01:03:40,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 01:03:40,092 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-12-25 01:03:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:03:40,093 INFO L225 Difference]: With dead ends: 285 [2023-12-25 01:03:40,094 INFO L226 Difference]: Without dead ends: 249 [2023-12-25 01:03:40,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2023-12-25 01:03:40,095 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 113 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 148 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:03:40,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 459 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 359 Invalid, 14 Unknown, 0 Unchecked, 70.4s Time] [2023-12-25 01:03:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-12-25 01:03:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 213. [2023-12-25 01:03:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 114 states have (on average 1.236842105263158) internal successors, (141), 122 states have internal predecessors, (141), 83 states have call successors, (83), 15 states have call predecessors, (83), 15 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-25 01:03:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 302 transitions. [2023-12-25 01:03:40,146 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 302 transitions. Word has length 23 [2023-12-25 01:03:40,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:03:40,146 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 302 transitions. [2023-12-25 01:03:40,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:03:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 302 transitions. [2023-12-25 01:03:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 01:03:40,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:03:40,147 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:03:40,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 01:03:40,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:03:40,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:03:40,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:03:40,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1533221826, now seen corresponding path program 1 times [2023-12-25 01:03:40,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:03:40,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307874228] [2023-12-25 01:03:40,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:03:40,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:03:40,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:03:40,349 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:03:40,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 01:03:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:03:40,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:03:40,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:03:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:03:40,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:03:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:03:40,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:03:40,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307874228] [2023-12-25 01:03:40,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307874228] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:03:40,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:03:40,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-12-25 01:03:40,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435772653] [2023-12-25 01:03:40,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:03:40,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:03:40,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:03:40,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:03:40,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:03:40,938 INFO L87 Difference]: Start difference. First operand 213 states and 302 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:04:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:04:00,639 INFO L93 Difference]: Finished difference Result 394 states and 567 transitions. [2023-12-25 01:04:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 01:04:00,652 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-25 01:04:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:04:00,653 INFO L225 Difference]: With dead ends: 394 [2023-12-25 01:04:00,653 INFO L226 Difference]: Without dead ends: 358 [2023-12-25 01:04:00,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:04:00,654 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 255 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:04:00,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 343 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 19.1s Time] [2023-12-25 01:04:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-12-25 01:04:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 277. [2023-12-25 01:04:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 145 states have (on average 1.2482758620689656) internal successors, (181), 156 states have internal predecessors, (181), 111 states have call successors, (111), 20 states have call predecessors, (111), 20 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-25 01:04:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 394 transitions. [2023-12-25 01:04:00,702 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 394 transitions. Word has length 23 [2023-12-25 01:04:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:04:00,704 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 394 transitions. [2023-12-25 01:04:00,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:04:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 394 transitions. [2023-12-25 01:04:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 01:04:00,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:04:00,705 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:04:00,710 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 (11)] Ended with exit code 0 [2023-12-25 01:04:00,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:04:00,908 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:04:00,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:04:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -671019762, now seen corresponding path program 2 times [2023-12-25 01:04:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:04:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157195205] [2023-12-25 01:04:00,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:04:00,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:04:00,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:04:00,910 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:04:00,911 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 (12)] Waiting until timeout for monitored process [2023-12-25 01:04:00,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 01:04:00,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:04:00,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 01:04:00,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:04:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 01:04:01,422 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:04:01,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:04:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157195205] [2023-12-25 01:04:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157195205] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:04:01,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:04:01,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 01:04:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119358657] [2023-12-25 01:04:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:04:01,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:04:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:04:01,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:04:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:04:01,424 INFO L87 Difference]: Start difference. First operand 277 states and 394 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:04:05,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:10,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:14,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:19,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:23,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:27,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:32,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:36,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:41,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:04:43,373 INFO L93 Difference]: Finished difference Result 354 states and 509 transitions. [2023-12-25 01:04:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:04:43,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-25 01:04:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:04:43,376 INFO L225 Difference]: With dead ends: 354 [2023-12-25 01:04:43,376 INFO L226 Difference]: Without dead ends: 338 [2023-12-25 01:04:43,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 01:04:43,376 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 18 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:04:43,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 127 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 41.8s Time] [2023-12-25 01:04:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-12-25 01:04:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 327. [2023-12-25 01:04:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 173 states have (on average 1.2196531791907514) internal successors, (211), 185 states have internal predecessors, (211), 128 states have call successors, (128), 25 states have call predecessors, (128), 25 states have return successors, (123), 116 states have call predecessors, (123), 123 states have call successors, (123) [2023-12-25 01:04:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 462 transitions. [2023-12-25 01:04:43,409 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 462 transitions. Word has length 24 [2023-12-25 01:04:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:04:43,410 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 462 transitions. [2023-12-25 01:04:43,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:04:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 462 transitions. [2023-12-25 01:04:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 01:04:43,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:04:43,410 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:04:43,413 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 (12)] Forceful destruction successful, exit code 0 [2023-12-25 01:04:43,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:04:43,613 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:04:43,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:04:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash -807874872, now seen corresponding path program 1 times [2023-12-25 01:04:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:04:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047204556] [2023-12-25 01:04:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:04:43,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:04:43,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:04:43,614 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:04:43,615 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 (13)] Waiting until timeout for monitored process [2023-12-25 01:04:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:04:43,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 01:04:43,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:04:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:04:44,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:05:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:05:31,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:05:31,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047204556] [2023-12-25 01:05:31,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047204556] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:05:31,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:05:31,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-25 01:05:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209102163] [2023-12-25 01:05:31,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:05:31,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:05:31,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:05:31,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:05:31,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2023-12-25 01:05:31,135 INFO L87 Difference]: Start difference. First operand 327 states and 462 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:05:45,289 WARN L293 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:05:47,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:59,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:11,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:21,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:23,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:29,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:39,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:41,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:06:41,900 INFO L93 Difference]: Finished difference Result 344 states and 483 transitions. [2023-12-25 01:06:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 01:06:41,949 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2023-12-25 01:06:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:06:41,951 INFO L225 Difference]: With dead ends: 344 [2023-12-25 01:06:41,951 INFO L226 Difference]: Without dead ends: 342 [2023-12-25 01:06:41,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=76, Invalid=265, Unknown=1, NotChecked=0, Total=342 [2023-12-25 01:06:41,952 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 54 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:06:41,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 224 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 42.2s Time] [2023-12-25 01:06:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-12-25 01:06:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 335. [2023-12-25 01:06:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 179 states have (on average 1.2067039106145252) internal successors, (216), 191 states have internal predecessors, (216), 128 states have call successors, (128), 27 states have call predecessors, (128), 27 states have return successors, (123), 116 states have call predecessors, (123), 123 states have call successors, (123) [2023-12-25 01:06:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 467 transitions. [2023-12-25 01:06:42,015 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 467 transitions. Word has length 30 [2023-12-25 01:06:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:06:42,015 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 467 transitions. [2023-12-25 01:06:42,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:06:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 467 transitions. [2023-12-25 01:06:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 01:06:42,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:06:42,017 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:06:42,037 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 (13)] Forceful destruction successful, exit code 0 [2023-12-25 01:06:42,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:06:42,228 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:06:42,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:06:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2032766579, now seen corresponding path program 2 times [2023-12-25 01:06:42,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:06:42,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310579436] [2023-12-25 01:06:42,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:06:42,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:06:42,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:06:42,230 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:06:42,230 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 (14)] Waiting until timeout for monitored process [2023-12-25 01:06:42,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:06:42,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:06:42,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 01:06:42,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:06:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:06:44,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:07:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:07:01,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:07:01,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310579436] [2023-12-25 01:07:01,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310579436] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:07:01,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:07:01,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-12-25 01:07:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139671474] [2023-12-25 01:07:01,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:07:01,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 01:07:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:07:01,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 01:07:01,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2023-12-25 01:07:01,543 INFO L87 Difference]: Start difference. First operand 335 states and 467 transitions. Second operand has 24 states, 24 states have (on average 2.5) internal successors, (60), 22 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:07:13,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:07:17,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:07:26,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:07:30,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:07:39,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:07:43,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:07:47,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:07:51,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:01,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:05,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:09,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:13,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:22,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:26,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:31,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:35,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:43,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:47,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:51,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:08:55,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:04,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:08,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:16,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:20,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:28,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:32,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:41,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:45,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:50,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:54,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:55,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:02,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:06,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:14,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:18,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:25,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:29,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:34,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:38,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:42,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:46,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:10:46,242 INFO L93 Difference]: Finished difference Result 627 states and 933 transitions. [2023-12-25 01:10:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 01:10:46,242 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 22 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2023-12-25 01:10:46,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:10:46,245 INFO L225 Difference]: With dead ends: 627 [2023-12-25 01:10:46,245 INFO L226 Difference]: Without dead ends: 570 [2023-12-25 01:10:46,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=396, Invalid=1086, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 01:10:46,246 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 277 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 371 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 193.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 197.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:10:46,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1511 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 1091 Invalid, 40 Unknown, 0 Unchecked, 197.7s Time] [2023-12-25 01:10:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2023-12-25 01:10:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 457. [2023-12-25 01:10:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 241 states have (on average 1.2406639004149378) internal successors, (299), 256 states have internal predecessors, (299), 182 states have call successors, (182), 33 states have call predecessors, (182), 33 states have return successors, (177), 167 states have call predecessors, (177), 177 states have call successors, (177) [2023-12-25 01:10:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 658 transitions. [2023-12-25 01:10:46,350 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 658 transitions. Word has length 35 [2023-12-25 01:10:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:10:46,350 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 658 transitions. [2023-12-25 01:10:46,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 22 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:10:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 658 transitions. [2023-12-25 01:10:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 01:10:46,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:10:46,352 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:10:46,356 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 (14)] Ended with exit code 0 [2023-12-25 01:10:46,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:10:46,554 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:10:46,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:10:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1135379661, now seen corresponding path program 2 times [2023-12-25 01:10:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:10:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918733929] [2023-12-25 01:10:46,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:10:46,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:10:46,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:10:46,556 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:10:46,596 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 (15)] Waiting until timeout for monitored process [2023-12-25 01:10:46,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:10:46,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:10:46,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 01:10:46,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:10:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 01:10:49,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:13:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 01:13:52,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:13:52,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918733929] [2023-12-25 01:13:52,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918733929] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:13:52,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:13:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-12-25 01:13:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674398131] [2023-12-25 01:13:52,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:13:52,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 01:13:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:13:52,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 01:13:52,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=405, Unknown=1, NotChecked=0, Total=506 [2023-12-25 01:13:52,236 INFO L87 Difference]: Start difference. First operand 457 states and 658 transitions. Second operand has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 01:14:13,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:38,435 WARN L293 SmtUtils]: Spent 1.10m on a formula simplification that was a NOOP. DAG size: 125 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-25 01:15:43,081 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:15:43,081 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 (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:15:44,106 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 01:15:44,282 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 01:15:44,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 01:15:44,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 195.1s TimeCoverageRelationStatistics Valid=135, Invalid=566, Unknown=1, NotChecked=0, Total=702 [2023-12-25 01:15:44,301 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 67 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:15:44,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 271 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2023-12-25 01:15:44,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:15:44,303 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 01:15:44,306 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:44,308 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:15:44,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:15:44 BoogieIcfgContainer [2023-12-25 01:15:44,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:15:44,309 INFO L158 Benchmark]: Toolchain (without parser) took 885454.79ms. Allocated memory was 178.3MB in the beginning and 252.7MB in the end (delta: 74.4MB). Free memory was 138.6MB in the beginning and 209.0MB in the end (delta: -70.3MB). Peak memory consumption was 140.8MB. Max. memory is 8.0GB. [2023-12-25 01:15:44,309 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:15:44,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.32ms. Allocated memory is still 178.3MB. Free memory was 138.3MB in the beginning and 125.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 01:15:44,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.80ms. Allocated memory is still 178.3MB. Free memory was 125.6MB in the beginning and 124.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:15:44,310 INFO L158 Benchmark]: Boogie Preprocessor took 27.70ms. Allocated memory is still 178.3MB. Free memory was 124.0MB in the beginning and 121.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:15:44,310 INFO L158 Benchmark]: RCFGBuilder took 372.97ms. Allocated memory is still 178.3MB. Free memory was 121.9MB in the beginning and 104.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-25 01:15:44,310 INFO L158 Benchmark]: TraceAbstraction took 884816.83ms. Allocated memory was 178.3MB in the beginning and 252.7MB in the end (delta: 74.4MB). Free memory was 104.0MB in the beginning and 209.0MB in the end (delta: -104.9MB). Peak memory consumption was 106.2MB. Max. memory is 8.0GB. [2023-12-25 01:15:44,311 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 178.3MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.32ms. Allocated memory is still 178.3MB. Free memory was 138.3MB in the beginning and 125.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.80ms. Allocated memory is still 178.3MB. Free memory was 125.6MB in the beginning and 124.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.70ms. Allocated memory is still 178.3MB. Free memory was 124.0MB in the beginning and 121.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 372.97ms. Allocated memory is still 178.3MB. Free memory was 121.9MB in the beginning and 104.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 884816.83ms. Allocated memory was 178.3MB in the beginning and 252.7MB in the end (delta: 74.4MB). Free memory was 104.0MB in the beginning and 209.0MB in the end (delta: -104.9MB). Peak memory consumption was 106.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 884.8s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 618.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 73 mSolverCounterUnknown, 1208 SdHoareTripleChecker+Valid, 460.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1060 mSDsluCounter, 4184 SdHoareTripleChecker+Invalid, 445.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3533 mSDsCounter, 1139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2873 IncrementalHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1139 mSolverCounterUnsat, 651 mSDtfsCounter, 2873 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 525 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 300.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=13, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 299 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 261.5s InterpolantComputationTime, 284 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 5707 SizeOfPredicates, 34 NumberOfNonLiveVariables, 624 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 110/396 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