/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/loop-lit/hh2012-ex3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:59:12,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:59:12,822 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-24 22:59:12,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:59:12,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:59:12,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:59:12,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:59:12,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:59:12,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:59:12,851 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:59:12,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:59:12,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:59:12,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:59:12,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:59:12,853 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:59:12,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:59:12,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:59:12,854 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:59:12,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:59:12,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:59:12,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:59:12,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:59:12,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:59:12,855 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:59:12,856 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:59:12,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:59:12,856 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:59:12,856 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:59:12,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:59:12,856 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:59:12,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:59:12,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:59:12,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:59:12,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:59:12,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:59:12,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:59:12,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:59:12,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:59:12,858 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:59:12,858 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:59:12,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:59:12,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:59:12,858 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:59:12,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:59:12,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:59:12,859 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:59:12,860 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-24 22:59:13,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:59:13,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:59:13,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:59:13,064 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:59:13,066 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:59:13,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hh2012-ex3.i [2023-12-24 22:59:14,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:59:14,256 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:59:14,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hh2012-ex3.i [2023-12-24 22:59:14,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88ad899f/ac05383abce64df6ab66b2d761f310f4/FLAG1b3bb9fcc [2023-12-24 22:59:14,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88ad899f/ac05383abce64df6ab66b2d761f310f4 [2023-12-24 22:59:14,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:59:14,278 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:59:14,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:59:14,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:59:14,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:59:14,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@685dbfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14, skipping insertion in model container [2023-12-24 22:59:14,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,307 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:59:14,417 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hh2012-ex3.i[799,812] [2023-12-24 22:59:14,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:59:14,441 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:59:14,449 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hh2012-ex3.i[799,812] [2023-12-24 22:59:14,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:59:14,462 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:59:14,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14 WrapperNode [2023-12-24 22:59:14,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:59:14,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:59:14,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:59:14,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:59:14,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,492 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2023-12-24 22:59:14,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:59:14,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:59:14,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:59:14,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:59:14,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,518 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-24 22:59:14,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:59:14,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:59:14,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:59:14,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:59:14,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (1/1) ... [2023-12-24 22:59:14,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:59:14,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:59:14,585 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-24 22:59:14,608 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-24 22:59:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:59:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:59:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:59:14,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:59:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-24 22:59:14,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-24 22:59:14,674 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:59:14,675 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:59:14,809 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:59:14,826 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:59:14,826 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-24 22:59:14,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:59:14 BoogieIcfgContainer [2023-12-24 22:59:14,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:59:14,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:59:14,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:59:14,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:59:14,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:59:14" (1/3) ... [2023-12-24 22:59:14,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589d4d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:59:14, skipping insertion in model container [2023-12-24 22:59:14,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:59:14" (2/3) ... [2023-12-24 22:59:14,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589d4d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:59:14, skipping insertion in model container [2023-12-24 22:59:14,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:59:14" (3/3) ... [2023-12-24 22:59:14,836 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2023-12-24 22:59:14,848 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:59:14,848 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:59:14,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:59:14,883 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;@6b6df039, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:59:14,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:59:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 22:59:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 22:59:14,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:59:14,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:59:14,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:59:14,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:59:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1998107271, now seen corresponding path program 1 times [2023-12-24 22:59:14,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:59:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851893964] [2023-12-24 22:59:14,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:59:14,906 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-24 22:59:14,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:59:14,908 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-24 22:59:14,909 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-24 22:59:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:59:14,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 22:59:14,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:59:14,979 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-24 22:59:14,979 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:59:14,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:59:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851893964] [2023-12-24 22:59:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851893964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:59:14,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:59:14,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 22:59:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049784440] [2023-12-24 22:59:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:59:14,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 22:59:14,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:59:15,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 22:59:15,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:59:15,007 INFO L87 Difference]: Start difference. First operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.0) 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-24 22:59:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:59:15,052 INFO L93 Difference]: Finished difference Result 40 states and 72 transitions. [2023-12-24 22:59:15,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 22:59:15,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) 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-24 22:59:15,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:59:15,058 INFO L225 Difference]: With dead ends: 40 [2023-12-24 22:59:15,058 INFO L226 Difference]: Without dead ends: 19 [2023-12-24 22:59:15,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:59:15,062 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:59:15,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:59:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-24 22:59:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-24 22:59:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 22:59:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2023-12-24 22:59:15,109 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 7 [2023-12-24 22:59:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:59:15,109 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2023-12-24 22:59:15,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) 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-24 22:59:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2023-12-24 22:59:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 22:59:15,110 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:59:15,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:59:15,126 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-24 22:59:15,321 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-24 22:59:15,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:59:15,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:59:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1996498557, now seen corresponding path program 1 times [2023-12-24 22:59:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:59:15,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282487052] [2023-12-24 22:59:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:59:15,323 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-24 22:59:15,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:59:15,332 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-24 22:59:15,333 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-24 22:59:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:59:15,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:59:15,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:59:15,413 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-24 22:59:15,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:59:15,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:59:15,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282487052] [2023-12-24 22:59:15,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282487052] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:59:15,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:59:15,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 22:59:15,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378715474] [2023-12-24 22:59:15,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:59:15,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 22:59:15,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:59:15,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 22:59:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 22:59:15,415 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-24 22:59:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:59:15,473 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2023-12-24 22:59:15,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 22:59:15,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-24 22:59:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:59:15,475 INFO L225 Difference]: With dead ends: 46 [2023-12-24 22:59:15,475 INFO L226 Difference]: Without dead ends: 28 [2023-12-24 22:59:15,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:59:15,476 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:59:15,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 86 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:59:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-24 22:59:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-24 22:59:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-24 22:59:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2023-12-24 22:59:15,485 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 7 [2023-12-24 22:59:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:59:15,485 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2023-12-24 22:59:15,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-24 22:59:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2023-12-24 22:59:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 22:59:15,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:59:15,486 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:59:15,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 22:59:15,687 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-24 22:59:15,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:59:15,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:59:15,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2106031398, now seen corresponding path program 1 times [2023-12-24 22:59:15,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:59:15,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486880383] [2023-12-24 22:59:15,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:59:15,689 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-24 22:59:15,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:59:15,691 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-24 22:59:15,692 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-24 22:59:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:59:15,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:59:15,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:59:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:59:15,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:59:15,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:59:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486880383] [2023-12-24 22:59:15,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486880383] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:59:15,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:59:15,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 22:59:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412581701] [2023-12-24 22:59:15,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:59:15,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 22:59:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:59:15,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 22:59:15,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:59:15,807 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-24 22:59:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:59:15,899 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-24 22:59:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 22:59:15,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 12 [2023-12-24 22:59:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:59:15,902 INFO L225 Difference]: With dead ends: 45 [2023-12-24 22:59:15,902 INFO L226 Difference]: Without dead ends: 43 [2023-12-24 22:59:15,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-24 22:59:15,905 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:59:15,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 78 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:59:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-24 22:59:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-12-24 22:59:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 22:59:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2023-12-24 22:59:15,922 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 12 [2023-12-24 22:59:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:59:15,923 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-12-24 22:59:15,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-24 22:59:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2023-12-24 22:59:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-24 22:59:15,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:59:15,924 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:59:15,927 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-24 22:59:16,127 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-24 22:59:16,127 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:59:16,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:59:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1617941577, now seen corresponding path program 1 times [2023-12-24 22:59:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:59:16,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996584307] [2023-12-24 22:59:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:59:16,132 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-24 22:59:16,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:59:16,133 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-24 22:59:16,135 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-24 22:59:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:59:16,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 22:59:16,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:59:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-24 22:59:16,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:59:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-24 22:59:16,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:59:16,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996584307] [2023-12-24 22:59:16,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996584307] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:59:16,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:59:16,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-24 22:59:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901124969] [2023-12-24 22:59:16,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:59:16,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 22:59:16,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:59:16,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 22:59:16,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:59:16,341 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 22:59:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:59:16,509 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2023-12-24 22:59:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 22:59:16,510 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 28 [2023-12-24 22:59:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:59:16,511 INFO L225 Difference]: With dead ends: 78 [2023-12-24 22:59:16,511 INFO L226 Difference]: Without dead ends: 51 [2023-12-24 22:59:16,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-12-24 22:59:16,512 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:59:16,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:59:16,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-24 22:59:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-24 22:59:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 22:59:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2023-12-24 22:59:16,521 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 28 [2023-12-24 22:59:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:59:16,522 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2023-12-24 22:59:16,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 22:59:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2023-12-24 22:59:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-24 22:59:16,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:59:16,523 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:59:16,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-24 22:59:16,724 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-24 22:59:16,725 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:59:16,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:59:16,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1192651634, now seen corresponding path program 2 times [2023-12-24 22:59:16,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:59:16,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292792609] [2023-12-24 22:59:16,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:59:16,726 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-24 22:59:16,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:59:16,727 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-24 22:59:16,734 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-24 22:59:16,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:59:16,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:59:16,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 22:59:16,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:59:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 22:59:16,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:59:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 22:59:17,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:59:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292792609] [2023-12-24 22:59:17,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292792609] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:59:17,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:59:17,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-24 22:59:17,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115770244] [2023-12-24 22:59:17,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:59:17,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 22:59:17,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:59:17,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 22:59:17,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-24 22:59:17,013 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-24 22:59:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:59:17,889 INFO L93 Difference]: Finished difference Result 97 states and 142 transitions. [2023-12-24 22:59:17,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 22:59:17,891 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 33 [2023-12-24 22:59:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:59:17,893 INFO L225 Difference]: With dead ends: 97 [2023-12-24 22:59:17,893 INFO L226 Difference]: Without dead ends: 95 [2023-12-24 22:59:17,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-12-24 22:59:17,893 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 22:59:17,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 160 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 22:59:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-24 22:59:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2023-12-24 22:59:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-24 22:59:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2023-12-24 22:59:17,913 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 33 [2023-12-24 22:59:17,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:59:17,913 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2023-12-24 22:59:17,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-24 22:59:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2023-12-24 22:59:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-24 22:59:17,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:59:17,914 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2023-12-24 22:59:17,929 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-24 22:59:18,116 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-24 22:59:18,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:59:18,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:59:18,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1502168995, now seen corresponding path program 3 times [2023-12-24 22:59:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:59:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517944950] [2023-12-24 22:59:18,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:59:18,118 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-24 22:59:18,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:59:18,119 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-24 22:59:18,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 22:59:18,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:59:18,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 22:59:18,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:59:18,151 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-24 22:59:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-24 22:59:18,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:59:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-24 22:59:18,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:59:18,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517944950] [2023-12-24 22:59:18,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517944950] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:59:18,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:59:18,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-12-24 22:59:18,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979718559] [2023-12-24 22:59:18,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:59:18,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 22:59:18,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:59:18,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 22:59:18,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-24 22:59:18,591 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand has 19 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 7 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 7 states have call successors, (20) [2023-12-24 22:59:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:59:20,070 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2023-12-24 22:59:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 22:59:20,071 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 7 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 7 states have call successors, (20) Word has length 59 [2023-12-24 22:59:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:59:20,072 INFO L225 Difference]: With dead ends: 136 [2023-12-24 22:59:20,072 INFO L226 Difference]: Without dead ends: 94 [2023-12-24 22:59:20,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2023-12-24 22:59:20,073 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 22:59:20,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 146 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 22:59:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-24 22:59:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-24 22:59:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-24 22:59:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2023-12-24 22:59:20,089 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 59 [2023-12-24 22:59:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:59:20,090 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. [2023-12-24 22:59:20,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 7 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 7 states have call successors, (20) [2023-12-24 22:59:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2023-12-24 22:59:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-24 22:59:20,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:59:20,091 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2023-12-24 22:59:20,094 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-24 22:59:20,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:59:20,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:59:20,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:59:20,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1014451502, now seen corresponding path program 4 times [2023-12-24 22:59:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:59:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470393902] [2023-12-24 22:59:20,295 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 22:59:20,295 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-24 22:59:20,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:59:20,296 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:59:20,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 22:59:20,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 22:59:20,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:59:20,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 22:59:20,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:59:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 22:59:20,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:59:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 22:59:20,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:59:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470393902] [2023-12-24 22:59:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470393902] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:59:20,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:59:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-24 22:59:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907747074] [2023-12-24 22:59:20,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:59:20,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 22:59:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:59:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 22:59:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-24 22:59:20,539 INFO L87 Difference]: Start difference. First operand 94 states and 125 transitions. Second operand has 16 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 8 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2023-12-24 22:59:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:59:20,695 INFO L93 Difference]: Finished difference Result 153 states and 202 transitions. [2023-12-24 22:59:20,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 22:59:20,696 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 8 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) Word has length 85 [2023-12-24 22:59:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:59:20,697 INFO L225 Difference]: With dead ends: 153 [2023-12-24 22:59:20,697 INFO L226 Difference]: Without dead ends: 102 [2023-12-24 22:59:20,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-24 22:59:20,698 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:59:20,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 252 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:59:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-24 22:59:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-24 22:59:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-24 22:59:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2023-12-24 22:59:20,724 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 128 transitions. Word has length 85 [2023-12-24 22:59:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:59:20,725 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 128 transitions. [2023-12-24 22:59:20,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 8 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2023-12-24 22:59:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 128 transitions. [2023-12-24 22:59:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 22:59:20,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:59:20,726 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:59:20,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 22:59:20,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:59:20,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:59:20,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:59:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1649128037, now seen corresponding path program 1 times [2023-12-24 22:59:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:59:20,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976126549] [2023-12-24 22:59:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:59:20,933 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-24 22:59:20,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:59:20,934 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-24 22:59:20,936 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-24 22:59:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:59:20,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 22:59:20,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:59:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-24 22:59:21,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:59:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 14 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2023-12-24 22:59:21,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:59:21,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976126549] [2023-12-24 22:59:21,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976126549] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:59:21,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:59:21,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2023-12-24 22:59:21,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346113036] [2023-12-24 22:59:21,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:59:21,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 22:59:21,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:59:21,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 22:59:21,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2023-12-24 22:59:21,745 INFO L87 Difference]: Start difference. First operand 102 states and 128 transitions. Second operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 7 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2023-12-24 22:59:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:59:22,671 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2023-12-24 22:59:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 22:59:22,671 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 7 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) Word has length 119 [2023-12-24 22:59:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:59:22,673 INFO L225 Difference]: With dead ends: 154 [2023-12-24 22:59:22,673 INFO L226 Difference]: Without dead ends: 152 [2023-12-24 22:59:22,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 214 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2023-12-24 22:59:22,674 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 22:59:22,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 221 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 22:59:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-24 22:59:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2023-12-24 22:59:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 74 states have internal predecessors, (74), 58 states have call successors, (58), 17 states have call predecessors, (58), 17 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-24 22:59:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 190 transitions. [2023-12-24 22:59:22,693 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 190 transitions. Word has length 119 [2023-12-24 22:59:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:59:22,693 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 190 transitions. [2023-12-24 22:59:22,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 7 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2023-12-24 22:59:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 190 transitions. [2023-12-24 22:59:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2023-12-24 22:59:22,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:59:22,696 INFO L195 NwaCegarLoop]: trace histogram [50, 49, 49, 11, 11, 11, 11, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2023-12-24 22:59:22,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-24 22:59:22,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:59:22,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:59:22,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:59:22,902 INFO L85 PathProgramCache]: Analyzing trace with hash 76144006, now seen corresponding path program 2 times [2023-12-24 22:59:22,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:59:22,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208134670] [2023-12-24 22:59:22,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:59:22,902 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-24 22:59:22,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:59:22,906 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:59:22,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 22:59:23,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:59:23,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:59:23,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-24 22:59:23,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:59:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5088 backedges. 98 proven. 286 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2023-12-24 22:59:23,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:59:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5088 backedges. 98 proven. 218 refuted. 0 times theorem prover too weak. 4772 trivial. 0 not checked. [2023-12-24 22:59:24,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:59:24,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208134670] [2023-12-24 22:59:24,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208134670] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:59:24,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:59:24,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 32 [2023-12-24 22:59:24,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606851072] [2023-12-24 22:59:24,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:59:24,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-24 22:59:24,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:59:24,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-24 22:59:24,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2023-12-24 22:59:24,506 INFO L87 Difference]: Start difference. First operand 149 states and 190 transitions. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 16 states have call successors, (76), 3 states have call predecessors, (76), 1 states have return successors, (74), 16 states have call predecessors, (74), 16 states have call successors, (74) [2023-12-24 22:59:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:59:28,694 INFO L93 Difference]: Finished difference Result 195 states and 254 transitions. [2023-12-24 22:59:28,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-24 22:59:28,696 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 16 states have call successors, (76), 3 states have call predecessors, (76), 1 states have return successors, (74), 16 states have call predecessors, (74), 16 states have call successors, (74) Word has length 268 [2023-12-24 22:59:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:59:28,697 INFO L225 Difference]: With dead ends: 195 [2023-12-24 22:59:28,697 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 22:59:28,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 496 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2023-12-24 22:59:28,699 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 17 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 22:59:28,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 904 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 22:59:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 22:59:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 22:59:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:59:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 22:59:28,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 268 [2023-12-24 22:59:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:59:28,700 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 22:59:28,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 16 states have call successors, (76), 3 states have call predecessors, (76), 1 states have return successors, (74), 16 states have call predecessors, (74), 16 states have call successors, (74) [2023-12-24 22:59:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 22:59:28,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 22:59:28,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:59:28,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 22:59:28,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:59:28,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 22:59:29,993 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 22:59:29,993 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-12-24 22:59:29,993 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) (bvsle |ULTIMATE.start_main_~i~0#1| (_ bv7 32)) (bvsle |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|)) [2023-12-24 22:59:29,993 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (let ((.cse2 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (let ((.cse0 (bvsle (_ bv3 32) .cse2)) (.cse1 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (or (and (bvsle (_ bv2 32) |ULTIMATE.start_main_~i~0#1|) .cse0 (bvsle .cse1 (_ bv6 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (and (bvsle |ULTIMATE.start_main_~i~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv3 32)) (bvsle (_ bv3 32) |ULTIMATE.start_main_~i~0#1|)) (and (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) .cse0 (bvsle (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (bvsle .cse2 (_ bv10 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) (bvsle .cse1 (_ bv5 32)) (bvsle (_ bv1 32) |ULTIMATE.start_main_~i~0#1|) (bvsle (_ bv1 32) .cse1))))) [2023-12-24 22:59:29,994 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (let ((.cse2 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (let ((.cse0 (bvsle (_ bv3 32) .cse2)) (.cse1 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (or (and (bvsle (_ bv2 32) |ULTIMATE.start_main_~i~0#1|) .cse0 (bvsle .cse1 (_ bv6 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (and (bvsle |ULTIMATE.start_main_~i~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv3 32)) (bvsle (_ bv3 32) |ULTIMATE.start_main_~i~0#1|)) (and (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) .cse0 (bvsle (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (bvsle .cse2 (_ bv10 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) (bvsle .cse1 (_ bv5 32)) (bvsle (_ bv1 32) |ULTIMATE.start_main_~i~0#1|) (bvsle (_ bv1 32) .cse1))))) [2023-12-24 22:59:29,994 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (let ((.cse2 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (let ((.cse0 (bvsle (_ bv3 32) .cse2)) (.cse1 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (or (and (bvsle (_ bv2 32) |ULTIMATE.start_main_~i~0#1|) .cse0 (bvsle .cse1 (_ bv6 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (and (bvsle |ULTIMATE.start_main_~i~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv3 32)) (bvsle (_ bv3 32) |ULTIMATE.start_main_~i~0#1|)) (and (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) .cse0 (bvsle (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (bvsle .cse2 (_ bv10 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) (bvsle .cse1 (_ bv5 32)) (bvsle (_ bv1 32) |ULTIMATE.start_main_~i~0#1|) (bvsle (_ bv1 32) .cse1))))) [2023-12-24 22:59:29,994 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 22:59:29,994 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (and (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) (bvsle |ULTIMATE.start_main_~i~0#1| (_ bv7 32)) (bvsle |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|)) [2023-12-24 22:59:29,997 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (and (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) (bvsle (_ bv3 32) .cse0) (bvsle (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (bvsle .cse0 (_ bv10 32)))) [2023-12-24 22:59:29,997 INFO L895 garLoopResultBuilder]: At program point L24(lines 18 25) the Hoare annotation is: (let ((.cse1 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse2 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (let ((.cse0 (bvsle (_ bv3 32) .cse2)) (.cse3 (bvsle (_ bv1 32) .cse1))) (or (and (bvsle (_ bv2 32) |ULTIMATE.start_main_~i~0#1|) .cse0 (bvsle .cse1 (_ bv6 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (and (bvsle |ULTIMATE.start_main_~i~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv3 32)) (bvsle (_ bv3 32) |ULTIMATE.start_main_~i~0#1|)) (and (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) .cse0 (bvsle (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (bvsle .cse2 (_ bv10 32))) (and (bvsle .cse1 (_ bv4 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)) .cse3) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) (bvsle .cse1 (_ bv5 32)) (bvsle (_ bv1 32) |ULTIMATE.start_main_~i~0#1|) .cse3)))) [2023-12-24 22:59:29,997 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (let ((.cse2 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (let ((.cse0 (bvsle (_ bv3 32) .cse2)) (.cse1 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (or (and (bvsle (_ bv2 32) |ULTIMATE.start_main_~i~0#1|) .cse0 (bvsle .cse1 (_ bv6 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (and (bvsle |ULTIMATE.start_main_~i~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv3 32)) (bvsle (_ bv3 32) |ULTIMATE.start_main_~i~0#1|)) (and (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) .cse0 (bvsle (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (bvsle .cse2 (_ bv10 32))) (and (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) (bvsle .cse1 (_ bv5 32)) (bvsle (_ bv1 32) |ULTIMATE.start_main_~i~0#1|) (bvsle (_ bv1 32) .cse1))))) [2023-12-24 22:59:29,997 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 18 25) the Hoare annotation is: (let ((.cse0 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (and (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) (bvsle (_ bv3 32) .cse0) (bvsle (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (bvsle .cse0 (_ bv10 32)))) [2023-12-24 22:59:29,997 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 16 31) the Hoare annotation is: (and (bvsle (_ bv3 32) (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (bvsle (_ bv1 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) [2023-12-24 22:59:29,997 INFO L899 garLoopResultBuilder]: For program point L16-3(lines 16 31) no Hoare annotation was computed. [2023-12-24 22:59:29,997 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-12-24 22:59:29,997 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2023-12-24 22:59:29,998 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2023-12-24 22:59:29,998 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2023-12-24 22:59:29,998 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 13) the Hoare annotation is: true [2023-12-24 22:59:29,998 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-12-24 22:59:30,000 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1] [2023-12-24 22:59:30,001 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:59:30,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:59:30 BoogieIcfgContainer [2023-12-24 22:59:30,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:59:30,009 INFO L158 Benchmark]: Toolchain (without parser) took 15730.46ms. Allocated memory was 249.6MB in the beginning and 299.9MB in the end (delta: 50.3MB). Free memory was 198.2MB in the beginning and 264.4MB in the end (delta: -66.2MB). Peak memory consumption was 156.2MB. Max. memory is 8.0GB. [2023-12-24 22:59:30,009 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 202.4MB. Free memory was 153.9MB in the beginning and 153.7MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:59:30,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.47ms. Allocated memory is still 249.6MB. Free memory was 198.2MB in the beginning and 187.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 22:59:30,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.24ms. Allocated memory is still 249.6MB. Free memory was 187.0MB in the beginning and 185.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 22:59:30,010 INFO L158 Benchmark]: Boogie Preprocessor took 33.28ms. Allocated memory is still 249.6MB. Free memory was 185.4MB in the beginning and 183.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:59:30,010 INFO L158 Benchmark]: RCFGBuilder took 299.92ms. Allocated memory is still 249.6MB. Free memory was 183.6MB in the beginning and 172.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-24 22:59:30,010 INFO L158 Benchmark]: TraceAbstraction took 15176.14ms. Allocated memory was 249.6MB in the beginning and 299.9MB in the end (delta: 50.3MB). Free memory was 172.1MB in the beginning and 264.4MB in the end (delta: -92.3MB). Peak memory consumption was 130.0MB. Max. memory is 8.0GB. [2023-12-24 22:59:30,011 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 202.4MB. Free memory was 153.9MB in the beginning and 153.7MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.47ms. Allocated memory is still 249.6MB. Free memory was 198.2MB in the beginning and 187.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.24ms. Allocated memory is still 249.6MB. Free memory was 187.0MB in the beginning and 185.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.28ms. Allocated memory is still 249.6MB. Free memory was 185.4MB in the beginning and 183.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 299.92ms. Allocated memory is still 249.6MB. Free memory was 183.6MB in the beginning and 172.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15176.14ms. Allocated memory was 249.6MB in the beginning and 299.9MB in the end (delta: 50.3MB). Free memory was 172.1MB in the beginning and 264.4MB in the end (delta: -92.3MB). Peak memory consumption was 130.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 9, TraceHistogramMax: 50, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 2017 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1782 mSDsCounter, 437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2800 IncrementalHoareTripleChecker+Invalid, 3237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 437 mSolverCounterUnsat, 235 mSDtfsCounter, 2800 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1218 GetRequests, 1072 SyntacticMatches, 12 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=8, InterpolantAutomatonStates: 107, 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, 9 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 158 PreInvPairs, 262 NumberOfFragments, 390 HoareAnnotationTreeSize, 158 FormulaSimplifications, 3859 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FormulaSimplificationsInter, 1683 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 618 NumberOfCodeBlocks, 593 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1195 ConstructedInterpolants, 0 QuantifiedInterpolants, 2948 SizeOfPredicates, 9 NumberOfNonLiveVariables, 971 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 12928/13598 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((3 <= ((4 + i) % 4294967296)) && (1 <= ((i + 1) % 4294967296))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((2 <= i) && (3 <= ((i + 3) % 4294967296))) && (((i + 1) % 4294967296) <= 6)) && (j == 2)) || (((i <= 6) && (j == 3)) && (3 <= i))) || ((((4 == j) && (3 <= ((i + 3) % 4294967296))) && (4 <= i)) && (((i + 3) % 4294967296) <= 10))) || (((((i + 1) % 4294967296) <= 4) && (j == 0)) && (1 <= ((i + 1) % 4294967296)))) || ((((j == 1) && (((i + 1) % 4294967296) <= 5)) && (1 <= i)) && (1 <= ((i + 1) % 4294967296)))) RESULT: Ultimate proved your program to be correct! [2023-12-24 22:59:30,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...