/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/ps4-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:13:22,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:13:23,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 17:13:23,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:13:23,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:13:23,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:13:23,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:13:23,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:13:23,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:13:23,110 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:13:23,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:13:23,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:13:23,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:13:23,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:13:23,112 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:13:23,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:13:23,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:13:23,113 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:13:23,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:13:23,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:13:23,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:13:23,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:13:23,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:13:23,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:13:23,116 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:13:23,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:13:23,116 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:13:23,117 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:13:23,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:13:23,117 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:13:23,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:13:23,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:13:23,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:13:23,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:13:23,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:13:23,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:13:23,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:13:23,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:13:23,119 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:13:23,120 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:13:23,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:13:23,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:13:23,120 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:13:23,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:13:23,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:13:23,121 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:13:23,121 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 17:13:23,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:13:23,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:13:23,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:13:23,487 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:13:23,487 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:13:23,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2023-12-16 17:13:24,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:13:24,816 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:13:24,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2023-12-16 17:13:24,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d814ef9/8ebaae223107419baca790a0c109ea82/FLAG648145806 [2023-12-16 17:13:24,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d814ef9/8ebaae223107419baca790a0c109ea82 [2023-12-16 17:13:24,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:13:24,852 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:13:24,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:13:24,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:13:24,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:13:24,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:13:24" (1/1) ... [2023-12-16 17:13:24,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28314756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:24, skipping insertion in model container [2023-12-16 17:13:24,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:13:24" (1/1) ... [2023-12-16 17:13:24,879 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:13:25,027 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/ps4-ll_unwindbound10.c[458,471] [2023-12-16 17:13:25,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:13:25,064 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:13:25,077 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/ps4-ll_unwindbound10.c[458,471] [2023-12-16 17:13:25,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:13:25,110 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:13:25,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25 WrapperNode [2023-12-16 17:13:25,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:13:25,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:13:25,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:13:25,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:13:25,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,141 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2023-12-16 17:13:25,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:13:25,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:13:25,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:13:25,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:13:25,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,178 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 17:13:25,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:13:25,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:13:25,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:13:25,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:13:25,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (1/1) ... [2023-12-16 17:13:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:13:25,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:13:25,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 17:13:25,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 17:13:25,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:13:25,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:13:25,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:13:25,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:13:25,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 17:13:25,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 17:13:25,319 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:13:25,321 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:13:25,581 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:13:25,620 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:13:25,621 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 17:13:25,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:13:25 BoogieIcfgContainer [2023-12-16 17:13:25,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:13:25,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:13:25,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:13:25,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:13:25,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:13:24" (1/3) ... [2023-12-16 17:13:25,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c279ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:13:25, skipping insertion in model container [2023-12-16 17:13:25,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:13:25" (2/3) ... [2023-12-16 17:13:25,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c279ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:13:25, skipping insertion in model container [2023-12-16 17:13:25,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:13:25" (3/3) ... [2023-12-16 17:13:25,631 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound10.c [2023-12-16 17:13:25,647 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:13:25,647 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:13:25,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:13:25,705 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;@270ae29a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:13:25,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:13:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 17:13:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 17:13:25,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:13:25,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 17:13:25,716 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:13:25,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:13:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2070802916, now seen corresponding path program 1 times [2023-12-16 17:13:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:13:25,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633096015] [2023-12-16 17:13:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:13:25,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-16 17:13:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:13:25,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:13:25,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 17:13:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:13:25,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 17:13:25,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:13:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:13:25,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:13:25,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:13:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633096015] [2023-12-16 17:13:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633096015] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:13:25,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:13:25,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:13:25,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825463022] [2023-12-16 17:13:25,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:13:25,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 17:13:25,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:13:25,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 17:13:25,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 17:13:25,958 INFO L87 Difference]: Start difference. First operand has 15 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:13:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:13:25,984 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2023-12-16 17:13:25,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 17:13:25,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2023-12-16 17:13:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:13:25,991 INFO L225 Difference]: With dead ends: 29 [2023-12-16 17:13:25,991 INFO L226 Difference]: Without dead ends: 13 [2023-12-16 17:13:25,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 17:13:25,998 INFO L413 NwaCegarLoop]: 16 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, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:13:25,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:13:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-16 17:13:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-16 17:13:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 17:13:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2023-12-16 17:13:26,026 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 6 [2023-12-16 17:13:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:13:26,026 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2023-12-16 17:13:26,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:13:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2023-12-16 17:13:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 17:13:26,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:13:26,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:13:26,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 (2)] Forceful destruction successful, exit code 0 [2023-12-16 17:13:26,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:13:26,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:13:26,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:13:26,235 INFO L85 PathProgramCache]: Analyzing trace with hash -170804699, now seen corresponding path program 1 times [2023-12-16 17:13:26,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:13:26,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105901756] [2023-12-16 17:13:26,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:13:26,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:13:26,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:13:26,237 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:13:26,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 17:13:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:13:26,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 17:13:26,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:13:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:13:26,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:13:26,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:13:26,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105901756] [2023-12-16 17:13:26,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105901756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:13:26,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:13:26,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:13:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709847681] [2023-12-16 17:13:26,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:13:26,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 17:13:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:13:26,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 17:13:26,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 17:13:26,362 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:13:26,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:13:26,387 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-12-16 17:13:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 17:13:26,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 17:13:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:13:26,388 INFO L225 Difference]: With dead ends: 23 [2023-12-16 17:13:26,388 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 17:13:26,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 17:13:26,390 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:13:26,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:13:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 17:13:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-16 17:13:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 17:13:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-16 17:13:26,395 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2023-12-16 17:13:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:13:26,395 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-16 17:13:26,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:13:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-16 17:13:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 17:13:26,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:13:26,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:13:26,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 17:13:26,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:13:26,601 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:13:26,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:13:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash -169017239, now seen corresponding path program 1 times [2023-12-16 17:13:26,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:13:26,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603100328] [2023-12-16 17:13:26,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:13:26,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:13:26,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:13:26,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:13:26,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 17:13:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:13:26,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:13:26,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:13:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:13:26,796 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:13:26,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:13:26,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603100328] [2023-12-16 17:13:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603100328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:13:26,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:13:26,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 17:13:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181262887] [2023-12-16 17:13:26,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:13:26,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:13:26,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:13:26,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:13:26,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:13:26,798 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:13:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:13:28,432 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2023-12-16 17:13:28,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:13:28,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 17:13:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:13:28,449 INFO L225 Difference]: With dead ends: 25 [2023-12-16 17:13:28,449 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 17:13:28,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:13:28,451 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 17:13:28,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 17:13:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 17:13:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-16 17:13:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 17:13:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-12-16 17:13:28,458 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2023-12-16 17:13:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:13:28,458 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-12-16 17:13:28,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:13:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-12-16 17:13:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 17:13:28,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:13:28,459 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:13:28,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 17:13:28,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:13:28,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:13:28,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:13:28,667 INFO L85 PathProgramCache]: Analyzing trace with hash 867499275, now seen corresponding path program 1 times [2023-12-16 17:13:28,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:13:28,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400014676] [2023-12-16 17:13:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:13:28,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:13:28,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:13:28,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:13:28,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 17:13:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:13:28,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:13:28,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:13:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:13:28,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:13:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:13:29,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:13:29,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400014676] [2023-12-16 17:13:29,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400014676] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:13:29,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:13:29,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-16 17:13:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607093905] [2023-12-16 17:13:29,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:13:29,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 17:13:29,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:13:29,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 17:13:29,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 17:13:29,116 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 17:13:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:13:33,400 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-12-16 17:13:33,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 17:13:33,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-12-16 17:13:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:13:33,427 INFO L225 Difference]: With dead ends: 55 [2023-12-16 17:13:33,428 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 17:13:33,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:13:33,429 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:13:33,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-16 17:13:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 17:13:33,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2023-12-16 17:13:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-16 17:13:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-12-16 17:13:33,437 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 15 [2023-12-16 17:13:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:13:33,437 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-12-16 17:13:33,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 17:13:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-12-16 17:13:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 17:13:33,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:13:33,438 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:13:33,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 17:13:33,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:13:33,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:13:33,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:13:33,642 INFO L85 PathProgramCache]: Analyzing trace with hash 869286735, now seen corresponding path program 1 times [2023-12-16 17:13:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:13:33,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668690641] [2023-12-16 17:13:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:13:33,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:13:33,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:13:33,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:13:33,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 17:13:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:13:33,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 17:13:33,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:13:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:13:34,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:13:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 17:13:48,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:13:48,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668690641] [2023-12-16 17:13:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668690641] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:13:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:13:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-16 17:13:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392988652] [2023-12-16 17:13:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:13:48,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:13:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:13:48,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:13:48,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 17:13:48,998 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:13:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:13:51,547 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2023-12-16 17:13:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:13:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-16 17:13:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:13:51,571 INFO L225 Difference]: With dead ends: 57 [2023-12-16 17:13:51,571 INFO L226 Difference]: Without dead ends: 46 [2023-12-16 17:13:51,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-16 17:13:51,573 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:13:51,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 35 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 17:13:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-16 17:13:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-12-16 17:13:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 17:13:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-12-16 17:13:51,586 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2023-12-16 17:13:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:13:51,587 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-12-16 17:13:51,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:13:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-12-16 17:13:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 17:13:51,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:13:51,588 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-16 17:13:51,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 17:13:51,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:13:51,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:13:51,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:13:51,801 INFO L85 PathProgramCache]: Analyzing trace with hash 24753612, now seen corresponding path program 1 times [2023-12-16 17:13:51,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:13:51,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268997067] [2023-12-16 17:13:51,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:13:51,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:13:51,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:13:51,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:13:51,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 17:13:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:13:52,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 17:13:52,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:13:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:13:52,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:14:03,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:14:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268997067] [2023-12-16 17:14:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268997067] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:14:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [937455900] [2023-12-16 17:14:03,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:14:03,690 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:14:03,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:14:03,732 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:14:03,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-16 17:14:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:14:04,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 17:14:04,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:14:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:14:04,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:14:09,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [937455900] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:14:09,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:14:09,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-12-16 17:14:09,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497500321] [2023-12-16 17:14:09,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:14:09,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 17:14:09,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:14:09,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 17:14:09,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:14:09,293 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 17:14:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:14:10,803 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2023-12-16 17:14:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:14:10,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-12-16 17:14:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:14:10,804 INFO L225 Difference]: With dead ends: 45 [2023-12-16 17:14:10,804 INFO L226 Difference]: Without dead ends: 40 [2023-12-16 17:14:10,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:14:10,805 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:14:10,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 17:14:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-16 17:14:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-16 17:14:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 17:14:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2023-12-16 17:14:10,816 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 21 [2023-12-16 17:14:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:14:10,816 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-12-16 17:14:10,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 17:14:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2023-12-16 17:14:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 17:14:10,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:14:10,818 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2023-12-16 17:14:10,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 17:14:11,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-16 17:14:11,230 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 17:14:11,231 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:14:11,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:14:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash 44232242, now seen corresponding path program 2 times [2023-12-16 17:14:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:14:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064170395] [2023-12-16 17:14:11,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:14:11,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:14:11,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:14:11,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:14:11,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 17:14:11,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:14:11,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:14:11,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 17:14:11,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:14:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 17:14:12,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:14:30,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:14:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064170395] [2023-12-16 17:14:30,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064170395] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:14:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1322804481] [2023-12-16 17:14:30,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:14:30,802 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:14:30,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:14:30,802 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:14:30,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-16 17:14:31,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:14:31,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:14:31,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 17:14:31,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:14:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 17:14:31,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:14:39,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1322804481] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:14:39,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:14:39,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-12-16 17:14:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021766431] [2023-12-16 17:14:39,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:14:39,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 17:14:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:14:39,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 17:14:39,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:14:39,836 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Received shutdown request... [2023-12-16 17:14:41,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:14:41,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:14:41,172 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 17:14:41,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 17:14:41,174 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:14:41,184 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 17:14:41,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 17:14:41,196 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 17:14:41,199 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 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 17:14:41,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-16 17:14:41,580 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 17:14:41,581 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (40states) and FLOYD_HOARE automaton (currently 5 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-4-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ATOM-1 context. [2023-12-16 17:14:41,585 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-12-16 17:14:41,588 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:14:41,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:14:41 BoogieIcfgContainer [2023-12-16 17:14:41,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:14:41,590 INFO L158 Benchmark]: Toolchain (without parser) took 76738.43ms. Allocated memory was 200.3MB in the beginning and 304.1MB in the end (delta: 103.8MB). Free memory was 150.8MB in the beginning and 232.5MB in the end (delta: -81.8MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. [2023-12-16 17:14:41,590 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 200.3MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:14:41,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.75ms. Allocated memory is still 200.3MB. Free memory was 150.4MB in the beginning and 139.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:14:41,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.99ms. Allocated memory is still 200.3MB. Free memory was 139.1MB in the beginning and 137.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 17:14:41,591 INFO L158 Benchmark]: Boogie Preprocessor took 59.91ms. Allocated memory is still 200.3MB. Free memory was 137.7MB in the beginning and 135.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:14:41,592 INFO L158 Benchmark]: RCFGBuilder took 418.69ms. Allocated memory is still 200.3MB. Free memory was 135.6MB in the beginning and 123.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:14:41,592 INFO L158 Benchmark]: TraceAbstraction took 75966.90ms. Allocated memory was 200.3MB in the beginning and 304.1MB in the end (delta: 103.8MB). Free memory was 123.0MB in the beginning and 232.5MB in the end (delta: -109.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:14:41,593 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.61ms. Allocated memory is still 200.3MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.75ms. Allocated memory is still 200.3MB. Free memory was 150.4MB in the beginning and 139.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.99ms. Allocated memory is still 200.3MB. Free memory was 139.1MB in the beginning and 137.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.91ms. Allocated memory is still 200.3MB. Free memory was 137.7MB in the beginning and 135.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 418.69ms. Allocated memory is still 200.3MB. Free memory was 135.6MB in the beginning and 123.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 75966.90ms. Allocated memory was 200.3MB in the beginning and 304.1MB in the end (delta: 103.8MB). Free memory was 123.0MB in the beginning and 232.5MB in the end (delta: -109.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 12). Cancelled while NwaCegarLoop was constructing difference of abstraction (40states) and FLOYD_HOARE automaton (currently 5 states, 8 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-4-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.9s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 361 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 266 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 95 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 29.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=4, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 60.0s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 888 SizeOfPredicates, 11 NumberOfNonLiveVariables, 367 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 63/102 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