/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-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 22:28:38,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 22:28:38,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-16 22:28:38,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 22:28:38,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 22:28:38,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 22:28:38,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 22:28:38,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 22:28:38,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 22:28:38,818 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 22:28:38,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 22:28:38,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 22:28:38,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 22:28:38,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 22:28:38,826 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 22:28:38,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 22:28:38,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 22:28:38,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 22:28:38,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 22:28:38,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 22:28:38,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 22:28:38,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 22:28:38,831 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 22:28:38,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 22:28:38,832 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 22:28:38,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 22:28:38,832 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 22:28:38,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 22:28:38,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 22:28:38,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 22:28:38,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 22:28:38,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 22:28:38,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 22:28:38,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 22:28:38,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 22:28:38,834 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 22:28:38,835 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 22:28:38,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 22:28:38,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 22:28:38,835 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 22:28:38,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 22:28:38,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 22:28:38,839 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 22:28:38,839 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 22:28:39,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 22:28:39,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 22:28:39,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 22:28:39,113 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 22:28:39,114 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 22:28:39,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2023-12-16 22:28:40,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 22:28:40,517 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 22:28:40,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2023-12-16 22:28:40,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edccfc79/9fc613a6ff2b485faf1e63f3d54d139e/FLAGa391077a5 [2023-12-16 22:28:40,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edccfc79/9fc613a6ff2b485faf1e63f3d54d139e [2023-12-16 22:28:40,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 22:28:40,549 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 22:28:40,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 22:28:40,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 22:28:40,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 22:28:40,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acd41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40, skipping insertion in model container [2023-12-16 22:28:40,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,582 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 22:28:40,733 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c[1247,1260] [2023-12-16 22:28:40,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 22:28:40,787 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 22:28:40,797 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs2.c[1247,1260] [2023-12-16 22:28:40,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 22:28:40,824 INFO L206 MainTranslator]: Completed translation [2023-12-16 22:28:40,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40 WrapperNode [2023-12-16 22:28:40,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 22:28:40,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 22:28:40,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 22:28:40,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 22:28:40,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,855 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2023-12-16 22:28:40,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 22:28:40,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 22:28:40,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 22:28:40,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 22:28:40,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,877 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 22:28:40,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 22:28:40,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 22:28:40,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 22:28:40,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 22:28:40,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (1/1) ... [2023-12-16 22:28:40,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 22:28:40,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 22:28:40,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 22:28:40,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 22:28:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 22:28:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 22:28:40,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 22:28:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 22:28:41,006 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 22:28:41,008 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 22:28:41,184 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 22:28:41,236 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 22:28:41,236 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 22:28:41,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:28:41 BoogieIcfgContainer [2023-12-16 22:28:41,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 22:28:41,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 22:28:41,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 22:28:41,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 22:28:41,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 10:28:40" (1/3) ... [2023-12-16 22:28:41,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380927bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:28:41, skipping insertion in model container [2023-12-16 22:28:41,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:28:40" (2/3) ... [2023-12-16 22:28:41,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380927bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:28:41, skipping insertion in model container [2023-12-16 22:28:41,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:28:41" (3/3) ... [2023-12-16 22:28:41,244 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2023-12-16 22:28:41,257 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 22:28:41,257 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 22:28:41,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 22:28:41,298 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;@e2ad195, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 22:28:41,298 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 22:28:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 22:28:41,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:28:41,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 22:28:41,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:28:41,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:28:41,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-16 22:28:41,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:28:41,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6442834] [2023-12-16 22:28:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 22:28:41,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-16 22:28:41,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:28:41,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 22:28:41,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 22:28:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 22:28:41,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 22:28:41,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:28:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:28:41,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 22:28:41,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:28:41,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6442834] [2023-12-16 22:28:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6442834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 22:28:41,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 22:28:41,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 22:28:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228882699] [2023-12-16 22:28:41,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 22:28:41,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 22:28:41,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:28:41,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 22:28:41,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 22:28:41,685 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:28:41,737 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-16 22:28:41,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 22:28:41,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-16 22:28:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:28:41,748 INFO L225 Difference]: With dead ends: 16 [2023-12-16 22:28:41,748 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 22:28:41,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 22:28:41,755 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 22:28:41,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 22:28:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 22:28:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-16 22:28:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-16 22:28:41,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-16 22:28:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:28:41,783 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-16 22:28:41,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-16 22:28:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 22:28:41,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:28:41,784 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-16 22:28:41,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 22:28:41,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 22:28:41,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:28:41,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:28:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-16 22:28:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:28:41,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527446911] [2023-12-16 22:28:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 22:28:41,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 22:28:41,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:28:41,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 22:28:42,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 22:28:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 22:28:42,050 WARN L260 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 22:28:42,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:28:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:28:42,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 22:28:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:28:42,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:28:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527446911] [2023-12-16 22:28:42,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527446911] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 22:28:42,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 22:28:42,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 22:28:42,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173766493] [2023-12-16 22:28:42,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 22:28:42,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 22:28:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:28:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 22:28:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 22:28:42,541 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:28:42,714 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-16 22:28:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 22:28:42,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 22:28:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:28:42,715 INFO L225 Difference]: With dead ends: 17 [2023-12-16 22:28:42,715 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 22:28:42,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 22:28:42,717 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 22:28:42,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 22:28:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 22:28:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-12-16 22:28:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-12-16 22:28:42,723 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2023-12-16 22:28:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:28:42,723 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-12-16 22:28:42,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-12-16 22:28:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 22:28:42,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:28:42,725 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-12-16 22:28:42,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 22:28:42,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 22:28:42,927 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:28:42,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:28:42,928 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 2 times [2023-12-16 22:28:42,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:28:42,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987488956] [2023-12-16 22:28:42,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 22:28:42,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 22:28:42,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:28:42,931 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 22:28:42,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 22:28:43,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 22:28:43,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 22:28:43,005 WARN L260 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-16 22:28:43,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:28:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:28:43,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 22:28:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:28:43,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:28:43,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987488956] [2023-12-16 22:28:43,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987488956] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 22:28:43,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 22:28:43,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 22:28:43,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883064377] [2023-12-16 22:28:43,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 22:28:43,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 22:28:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:28:43,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 22:28:43,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-16 22:28:43,870 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:28:44,595 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-12-16 22:28:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 22:28:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 22:28:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:28:44,596 INFO L225 Difference]: With dead ends: 29 [2023-12-16 22:28:44,596 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 22:28:44,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2023-12-16 22:28:44,598 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 22:28:44,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 19 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 22:28:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 22:28:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-12-16 22:28:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2023-12-16 22:28:44,606 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2023-12-16 22:28:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:28:44,607 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2023-12-16 22:28:44,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2023-12-16 22:28:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 22:28:44,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:28:44,609 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2023-12-16 22:28:44,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 22:28:44,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 22:28:44,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:28:44,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:28:44,816 INFO L85 PathProgramCache]: Analyzing trace with hash 284396189, now seen corresponding path program 3 times [2023-12-16 22:28:44,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:28:44,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372034838] [2023-12-16 22:28:44,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 22:28:44,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 22:28:44,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:28:44,818 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 22:28:44,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 22:28:44,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-16 22:28:44,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 22:28:44,959 WARN L260 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 146 conjunts are in the unsatisfiable core [2023-12-16 22:28:44,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:28:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:28:45,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 22:28:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:28:46,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:28:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372034838] [2023-12-16 22:28:46,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372034838] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 22:28:46,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 22:28:46,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-12-16 22:28:46,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469743806] [2023-12-16 22:28:46,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 22:28:46,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 22:28:46,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:28:46,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 22:28:46,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2023-12-16 22:28:46,898 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:28:48,832 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-12-16 22:28:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-16 22:28:48,832 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-16 22:28:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:28:48,834 INFO L225 Difference]: With dead ends: 47 [2023-12-16 22:28:48,835 INFO L226 Difference]: Without dead ends: 45 [2023-12-16 22:28:48,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=392, Invalid=1014, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 22:28:48,836 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 22:28:48,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 26 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 22:28:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-16 22:28:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2023-12-16 22:28:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2023-12-16 22:28:48,858 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 25 [2023-12-16 22:28:48,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:28:48,859 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2023-12-16 22:28:48,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:28:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2023-12-16 22:28:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 22:28:48,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:28:48,861 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1] [2023-12-16 22:28:48,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 22:28:49,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 22:28:49,065 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:28:49,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:28:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2052584739, now seen corresponding path program 4 times [2023-12-16 22:28:49,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:28:49,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650649342] [2023-12-16 22:28:49,067 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 22:28:49,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 22:28:49,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:28:49,068 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 22:28:49,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 22:28:49,278 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 22:28:49,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 22:28:49,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 22:28:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 22:28:49,541 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 22:28:49,542 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 22:28:49,542 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 22:28:49,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 22:28:49,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 22:28:49,754 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-12-16 22:28:49,756 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 22:28:49,813 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,813 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,813 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,814 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:28:49,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 10:28:49 BoogieIcfgContainer [2023-12-16 22:28:49,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 22:28:49,835 INFO L158 Benchmark]: Toolchain (without parser) took 9286.08ms. Allocated memory was 291.5MB in the beginning and 354.4MB in the end (delta: 62.9MB). Free memory was 230.6MB in the beginning and 217.5MB in the end (delta: 13.1MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. [2023-12-16 22:28:49,835 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 191.9MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 22:28:49,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.72ms. Allocated memory is still 291.5MB. Free memory was 230.3MB in the beginning and 218.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 22:28:49,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.33ms. Allocated memory is still 291.5MB. Free memory was 218.0MB in the beginning and 216.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 22:28:49,836 INFO L158 Benchmark]: Boogie Preprocessor took 34.13ms. Allocated memory is still 291.5MB. Free memory was 216.2MB in the beginning and 214.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 22:28:49,836 INFO L158 Benchmark]: RCFGBuilder took 345.90ms. Allocated memory is still 291.5MB. Free memory was 214.1MB in the beginning and 255.4MB in the end (delta: -41.3MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2023-12-16 22:28:49,837 INFO L158 Benchmark]: TraceAbstraction took 8595.85ms. Allocated memory was 291.5MB in the beginning and 354.4MB in the end (delta: 62.9MB). Free memory was 254.4MB in the beginning and 217.5MB in the end (delta: 36.9MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2023-12-16 22:28:49,838 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 191.9MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.72ms. Allocated memory is still 291.5MB. Free memory was 230.3MB in the beginning and 218.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.33ms. Allocated memory is still 291.5MB. Free memory was 218.0MB in the beginning and 216.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.13ms. Allocated memory is still 291.5MB. Free memory was 216.2MB in the beginning and 214.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 345.90ms. Allocated memory is still 291.5MB. Free memory was 214.1MB in the beginning and 255.4MB in the end (delta: -41.3MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8595.85ms. Allocated memory was 291.5MB in the beginning and 354.4MB in the end (delta: 62.9MB). Free memory was 254.4MB in the beginning and 217.5MB in the end (delta: 36.9MB). Peak memory consumption was 100.3MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, state_6=0, state_9=6, var_14=1, var_21=2, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=2, next_28_arg_1=8, state_6=2, state_9=8, var_11=1, var_11_arg_0=0, var_11_arg_1=6, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=0, var_20_arg_0=0, var_21=2, var_22=2, var_22_arg_0=0, var_22_arg_1=2, var_23=2, var_23_arg_0=2, var_25=6, var_25_arg_0=6, var_26=8, var_26_arg_0=6, var_26_arg_1=2, var_27=8, var_27_arg_0=8, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=4, next_28_arg_1=10, state_6=4, state_9=10, var_11=1, var_11_arg_0=2, var_11_arg_1=8, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=2, var_20_arg_0=2, var_21=2, var_22=4, var_22_arg_0=2, var_22_arg_1=2, var_23=4, var_23_arg_0=4, var_25=8, var_25_arg_0=8, var_26=10, var_26_arg_0=8, var_26_arg_1=2, var_27=10, var_27_arg_0=10, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=6, next_28_arg_1=12, state_6=6, state_9=12, var_11=1, var_11_arg_0=4, var_11_arg_1=10, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=4, var_20_arg_0=4, var_21=2, var_22=6, var_22_arg_0=4, var_22_arg_1=2, var_23=6, var_23_arg_0=6, var_25=10, var_25_arg_0=10, var_26=12, var_26_arg_0=10, var_26_arg_1=2, var_27=12, var_27_arg_0=12, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=8, next_28_arg_1=14, state_6=8, state_9=14, var_11=1, var_11_arg_0=6, var_11_arg_1=12, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=6, var_20_arg_0=6, var_21=2, var_22=8, var_22_arg_0=6, var_22_arg_1=2, var_23=8, var_23_arg_0=8, var_25=12, var_25_arg_0=12, var_26=14, var_26_arg_0=12, var_26_arg_1=2, var_27=14, var_27_arg_0=14, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=10, next_28_arg_1=16, state_6=10, state_9=16, var_11=1, var_11_arg_0=8, var_11_arg_1=14, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=8, var_20_arg_0=8, var_21=2, var_22=10, var_22_arg_0=8, var_22_arg_1=2, var_23=10, var_23_arg_0=10, var_25=14, var_25_arg_0=14, var_26=16, var_26_arg_0=14, var_26_arg_1=2, var_27=16, var_27_arg_0=16, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=12, next_28_arg_1=18, state_6=12, state_9=18, var_11=1, var_11_arg_0=10, var_11_arg_1=16, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=10, var_20_arg_0=10, var_21=2, var_22=12, var_22_arg_0=10, var_22_arg_1=2, var_23=12, var_23_arg_0=12, var_25=16, var_25_arg_0=16, var_26=18, var_26_arg_0=16, var_26_arg_1=2, var_27=18, var_27_arg_0=18, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=14, next_28_arg_1=20, state_6=14, state_9=20, var_11=1, var_11_arg_0=12, var_11_arg_1=18, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=12, var_20_arg_0=12, var_21=2, var_22=14, var_22_arg_0=12, var_22_arg_1=2, var_23=14, var_23_arg_0=14, var_25=18, var_25_arg_0=18, var_26=20, var_26_arg_0=18, var_26_arg_1=2, var_27=20, var_27_arg_0=20, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=16, next_28_arg_1=22, state_6=16, state_9=22, var_11=1, var_11_arg_0=14, var_11_arg_1=20, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=14, var_20_arg_0=14, var_21=2, var_22=16, var_22_arg_0=14, var_22_arg_1=2, var_23=16, var_23_arg_0=16, var_25=20, var_25_arg_0=20, var_26=22, var_26_arg_0=20, var_26_arg_1=2, var_27=22, var_27_arg_0=22, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=18, next_28_arg_1=24, state_6=18, state_9=24, var_11=1, var_11_arg_0=16, var_11_arg_1=22, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=16, var_20_arg_0=16, var_21=2, var_22=18, var_22_arg_0=16, var_22_arg_1=2, var_23=18, var_23_arg_0=18, var_25=22, var_25_arg_0=22, var_26=24, var_26_arg_0=22, var_26_arg_1=2, var_27=24, var_27_arg_0=24, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=20, next_28_arg_1=26, state_6=20, state_9=26, var_11=1, var_11_arg_0=18, var_11_arg_1=24, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=18, var_20_arg_0=18, var_21=2, var_22=20, var_22_arg_0=18, var_22_arg_1=2, var_23=20, var_23_arg_0=20, var_25=24, var_25_arg_0=24, var_26=26, var_26_arg_0=24, var_26_arg_1=2, var_27=26, var_27_arg_0=26, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=22, next_28_arg_1=28, state_6=22, state_9=28, var_11=1, var_11_arg_0=20, var_11_arg_1=26, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=20, var_20_arg_0=20, var_21=2, var_22=22, var_22_arg_0=20, var_22_arg_1=2, var_23=22, var_23_arg_0=22, var_25=26, var_25_arg_0=26, var_26=28, var_26_arg_0=26, var_26_arg_1=2, var_27=28, var_27_arg_0=28, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=24, next_28_arg_1=30, state_6=24, state_9=30, var_11=1, var_11_arg_0=22, var_11_arg_1=28, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=22, var_20_arg_0=22, var_21=2, var_22=24, var_22_arg_0=22, var_22_arg_1=2, var_23=24, var_23_arg_0=24, var_25=28, var_25_arg_0=28, var_26=30, var_26_arg_0=28, var_26_arg_1=2, var_27=30, var_27_arg_0=30, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=26, next_28_arg_1=0, state_6=26, state_9=0, var_11=1, var_11_arg_0=24, var_11_arg_1=30, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=24, var_20_arg_0=24, var_21=2, var_22=26, var_22_arg_0=24, var_22_arg_1=2, var_23=26, var_23_arg_0=26, var_25=30, var_25_arg_0=30, var_26=32, var_26_arg_0=30, var_26_arg_1=2, var_27=0, var_27_arg_0=32, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 341 IncrementalHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 8 mSDtfsCounter, 341 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=4, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 87 ConstructedInterpolants, 36 QuantifiedInterpolants, 7919 SizeOfPredicates, 250 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-16 22:28:49,859 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...