/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.bit-vector.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 16:35:12,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 16:35:12,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-01 16:35:12,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 16:35:12,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 16:35:12,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 16:35:12,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 16:35:12,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 16:35:12,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 16:35:12,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 16:35:12,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 16:35:12,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 16:35:12,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 16:35:12,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 16:35:12,559 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 16:35:12,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 16:35:12,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 16:35:12,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 16:35:12,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 16:35:12,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 16:35:12,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 16:35:12,563 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 16:35:12,563 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 16:35:12,563 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 16:35:12,564 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 16:35:12,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 16:35:12,564 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 16:35:12,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 16:35:12,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 16:35:12,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 16:35:12,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 16:35:12,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 16:35:12,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 16:35:12,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 16:35:12,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 16:35:12,566 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 16:35:12,566 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 16:35:12,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 16:35:12,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 16:35:12,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 16:35:12,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 16:35:12,567 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 16:35:12,567 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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 [2024-11-01 16:35:12,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 16:35:12,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 16:35:12,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 16:35:12,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 16:35:12,827 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 16:35:12,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.bit-vector.c [2024-11-01 16:35:13,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 16:35:14,147 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 16:35:14,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.bit-vector.c [2024-11-01 16:35:14,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c366a73/b916b24869ef4df8a05ce6e2aa39cb16/FLAG81b29653a [2024-11-01 16:35:14,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c366a73/b916b24869ef4df8a05ce6e2aa39cb16 [2024-11-01 16:35:14,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 16:35:14,576 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 16:35:14,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 16:35:14,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 16:35:14,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 16:35:14,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f31c93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14, skipping insertion in model container [2024-11-01 16:35:14,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 16:35:14,727 WARN L251 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.bit-vector.c[1250,1263] [2024-11-01 16:35:14,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 16:35:14,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 16:35:14,789 WARN L251 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.bit-vector.c[1250,1263] [2024-11-01 16:35:14,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 16:35:14,822 INFO L204 MainTranslator]: Completed translation [2024-11-01 16:35:14,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14 WrapperNode [2024-11-01 16:35:14,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 16:35:14,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 16:35:14,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 16:35:14,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 16:35:14,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,848 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2024-11-01 16:35:14,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 16:35:14,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 16:35:14,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 16:35:14,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 16:35:14,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,870 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]. [2024-11-01 16:35:14,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 16:35:14,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 16:35:14,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 16:35:14,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 16:35:14,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (1/1) ... [2024-11-01 16:35:14,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 16:35:14,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 16:35:14,916 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) [2024-11-01 16:35:14,921 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 [2024-11-01 16:35:14,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 16:35:14,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 16:35:14,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 16:35:14,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 16:35:14,993 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 16:35:14,994 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 16:35:15,133 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-01 16:35:15,133 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 16:35:15,146 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 16:35:15,147 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 16:35:15,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:35:15 BoogieIcfgContainer [2024-11-01 16:35:15,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 16:35:15,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 16:35:15,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 16:35:15,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 16:35:15,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 04:35:14" (1/3) ... [2024-11-01 16:35:15,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501a28f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:35:15, skipping insertion in model container [2024-11-01 16:35:15,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:35:14" (2/3) ... [2024-11-01 16:35:15,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501a28f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:35:15, skipping insertion in model container [2024-11-01 16:35:15,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:35:15" (3/3) ... [2024-11-01 16:35:15,156 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bit-vector.c [2024-11-01 16:35:15,168 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 16:35:15,169 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 16:35:15,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 16:35:15,222 INFO L333 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, 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;@10cc4096, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 16:35:15,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 16:35:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 16:35:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-01 16:35:15,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:35:15,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-01 16:35:15,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:35:15,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:35:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-01 16:35:15,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:35:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1013112211] [2024-11-01 16:35:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:35:15,247 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 [2024-11-01 16:35:15,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:35:15,250 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) [2024-11-01 16:35:15,251 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 [2024-11-01 16:35:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:35:15,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-01 16:35:15,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:35:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 16:35:15,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:35:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 16:35:15,658 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 16:35:15,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1013112211] [2024-11-01 16:35:15,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1013112211] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 16:35:15,659 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 16:35:15,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 16:35:15,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91031421] [2024-11-01 16:35:15,661 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 16:35:15,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 16:35:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 16:35:15,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 16:35:15,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 16:35:15,686 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2024-11-01 16:35:15,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 16:35:15,728 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-01 16:35:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 16:35:15,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) Word has length 5 [2024-11-01 16:35:15,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 16:35:15,737 INFO L225 Difference]: With dead ends: 18 [2024-11-01 16:35:15,737 INFO L226 Difference]: Without dead ends: 10 [2024-11-01 16:35:15,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-01 16:35:15,741 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-01 16:35:15,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 16:35:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-01 16:35:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-01 16:35:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2024-11-01 16:35:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-01 16:35:15,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-01 16:35:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 16:35:15,765 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-01 16:35:15,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2024-11-01 16:35:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-01 16:35:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-01 16:35:15,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:35:15,766 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-01 16:35:15,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-01 16:35:15,966 WARN L453 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 [2024-11-01 16:35:15,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:35:15,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:35:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-01 16:35:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:35:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1634525629] [2024-11-01 16:35:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:35:15,968 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 [2024-11-01 16:35:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:35:15,970 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) [2024-11-01 16:35:15,971 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 [2024-11-01 16:35:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:35:16,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-01 16:35:16,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:35:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 16:35:16,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:35:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 16:35:16,329 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 16:35:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1634525629] [2024-11-01 16:35:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1634525629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 16:35:16,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 16:35:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-01 16:35:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020251513] [2024-11-01 16:35:16,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 16:35:16,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-01 16:35:16,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 16:35:16,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-01 16:35:16,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-01 16:35:16,331 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2024-11-01 16:35:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 16:35:16,520 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-01 16:35:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-01 16:35:16,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) Word has length 8 [2024-11-01 16:35:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 16:35:16,521 INFO L225 Difference]: With dead ends: 18 [2024-11-01 16:35:16,522 INFO L226 Difference]: Without dead ends: 16 [2024-11-01 16:35:16,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-01 16:35:16,523 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 16:35:16,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 16:35:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-01 16:35:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-01 16:35:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 16:35:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-01 16:35:16,528 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-01 16:35:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 16:35:16,529 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-01 16:35:16,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2024-11-01 16:35:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-01 16:35:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-01 16:35:16,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:35:16,529 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-01 16:35:16,533 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 [2024-11-01 16:35:16,730 WARN L453 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 [2024-11-01 16:35:16,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:35:16,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:35:16,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-01 16:35:16,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:35:16,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [552521516] [2024-11-01 16:35:16,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:35:16,731 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 [2024-11-01 16:35:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:35:16,734 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) [2024-11-01 16:35:16,735 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 [2024-11-01 16:35:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:35:16,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-01 16:35:16,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:35:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 16:35:17,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:35:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 16:35:17,443 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 16:35:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [552521516] [2024-11-01 16:35:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [552521516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 16:35:17,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 16:35:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-01 16:35:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682257046] [2024-11-01 16:35:17,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 16:35:17,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-01 16:35:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 16:35:17,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-01 16:35:17,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-01 16:35:17,446 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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) [2024-11-01 16:35:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 16:35:18,331 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-01 16:35:18,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-01 16:35:18,331 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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) Word has length 14 [2024-11-01 16:35:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 16:35:18,332 INFO L225 Difference]: With dead ends: 33 [2024-11-01 16:35:18,332 INFO L226 Difference]: Without dead ends: 31 [2024-11-01 16:35:18,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2024-11-01 16:35:18,333 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 16:35:18,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 23 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 16:35:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-01 16:35:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-01 16:35:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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) [2024-11-01 16:35:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-11-01 16:35:18,340 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 14 [2024-11-01 16:35:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 16:35:18,341 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-11-01 16:35:18,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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) [2024-11-01 16:35:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-11-01 16:35:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-01 16:35:18,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:35:18,341 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1] [2024-11-01 16:35:18,345 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 (4)] Ended with exit code 0 [2024-11-01 16:35:18,544 WARN L453 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 [2024-11-01 16:35:18,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:35:18,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:35:18,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1529996805, now seen corresponding path program 3 times [2024-11-01 16:35:18,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:35:18,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2028358857] [2024-11-01 16:35:18,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:35:18,545 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 [2024-11-01 16:35:18,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:35:18,548 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) [2024-11-01 16:35:18,548 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 [2024-11-01 16:35:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:35:18,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-01 16:35:18,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:35:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-01 16:35:19,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:35:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-01 16:35:19,972 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 16:35:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2028358857] [2024-11-01 16:35:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2028358857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 16:35:19,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 16:35:19,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2024-11-01 16:35:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898724244] [2024-11-01 16:35:19,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 16:35:19,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-01 16:35:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 16:35:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-01 16:35:19,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-01 16:35:19,974 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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) [2024-11-01 16:35:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 16:35:20,555 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-01 16:35:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-01 16:35:20,557 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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 29 [2024-11-01 16:35:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 16:35:20,557 INFO L225 Difference]: With dead ends: 33 [2024-11-01 16:35:20,557 INFO L226 Difference]: Without dead ends: 0 [2024-11-01 16:35:20,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2024-11-01 16:35:20,558 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 16:35:20,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 16:35:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-01 16:35:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-01 16:35:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 16:35:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-01 16:35:20,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-11-01 16:35:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 16:35:20,559 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-01 16:35:20,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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) [2024-11-01 16:35:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-01 16:35:20,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-01 16:35:20,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-01 16:35:20,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-01 16:35:20,762 WARN L453 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 [2024-11-01 16:35:20,765 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-01 16:35:20,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-01 16:35:20,979 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-01 16:35:20,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-01 16:35:20,992 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-01 16:35:20,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 04:35:20 BoogieIcfgContainer [2024-11-01 16:35:20,998 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-01 16:35:20,999 INFO L158 Benchmark]: Toolchain (without parser) took 6423.00ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 160.6MB in the beginning and 135.3MB in the end (delta: 25.3MB). Peak memory consumption was 72.7MB. Max. memory is 8.0GB. [2024-11-01 16:35:20,999 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 205.5MB. Free memory is still 182.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 16:35:20,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.83ms. Allocated memory is still 205.5MB. Free memory was 160.6MB in the beginning and 181.7MB in the end (delta: -21.1MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2024-11-01 16:35:20,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.84ms. Allocated memory is still 205.5MB. Free memory was 181.7MB in the beginning and 180.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 16:35:21,000 INFO L158 Benchmark]: Boogie Preprocessor took 39.05ms. Allocated memory is still 205.5MB. Free memory was 180.1MB in the beginning and 178.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 16:35:21,000 INFO L158 Benchmark]: RCFGBuilder took 255.26ms. Allocated memory is still 205.5MB. Free memory was 178.0MB in the beginning and 164.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-01 16:35:21,000 INFO L158 Benchmark]: TraceAbstraction took 5849.58ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 163.3MB in the beginning and 135.3MB in the end (delta: 28.1MB). Peak memory consumption was 74.2MB. Max. memory is 8.0GB. [2024-11-01 16:35:21,001 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 205.5MB. Free memory is still 182.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.83ms. Allocated memory is still 205.5MB. Free memory was 160.6MB in the beginning and 181.7MB in the end (delta: -21.1MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.84ms. Allocated memory is still 205.5MB. Free memory was 181.7MB in the beginning and 180.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.05ms. Allocated memory is still 205.5MB. Free memory was 180.1MB in the beginning and 178.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 255.26ms. Allocated memory is still 205.5MB. Free memory was 178.0MB in the beginning and 164.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5849.58ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 163.3MB in the beginning and 135.3MB in the end (delta: 28.1MB). Peak memory consumption was 74.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 14 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, InterpolantAutomatonStates: 42, 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, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 104 ConstructedInterpolants, 40 QuantifiedInterpolants, 27016 SizeOfPredicates, 19 NumberOfNonLiveVariables, 364 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 18/234 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((((2 == var_9) && (7 == mask_SORT_3)) && (0 == ((110 + state_5) % 256))) && (3 == mask_SORT_21)) && (1 == mask_SORT_1)) || ((((((2 == var_9) && (7 == mask_SORT_3)) && (4 == state_18)) && (3 == mask_SORT_21)) && (27 == state_5)) && (1 == mask_SORT_1))) || ((((((2 == var_9) && (7 == mask_SORT_3)) && (2 == state_5)) && (3 == mask_SORT_21)) && (6 == state_18)) && (1 == mask_SORT_1))) || (((((2 == var_9) && (36 == state_18)) && (7 == mask_SORT_3)) && (3 == mask_SORT_21)) && (1 == mask_SORT_1))) || ((((((2 == var_9) && (7 == mask_SORT_3)) && (54 == state_18)) && (3 == mask_SORT_21)) && (1 == mask_SORT_1)) && (18 == state_5))) RESULT: Ultimate proved your program to be correct! [2024-11-01 16:35:21,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...