/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:02:43,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:02:43,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:02:43,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:02:43,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:02:43,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:02:43,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:02:43,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:02:43,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:02:43,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:02:43,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:02:43,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:02:43,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:02:43,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:02:43,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:02:43,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:02:43,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:02:43,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:02:43,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:02:43,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:02:43,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:02:43,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:02:43,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:02:43,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:02:43,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:02:43,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:02:43,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:02:43,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:02:43,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:02:43,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:02:43,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:02:43,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:02:43,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:02:43,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:02:43,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:02:43,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:02:43,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:02:43,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:02:43,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:02:43,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:02:43,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:02:43,593 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:02:43,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:02:43,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:02:43,629 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:02:43,629 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:02:43,630 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:02:43,630 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:02:43,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:02:43,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:02:43,630 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:02:43,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:02:43,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:02:43,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:02:43,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:02:43,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:02:43,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:02:43,631 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:02:43,631 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:02:43,632 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:02:43,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:02:43,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:02:43,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:02:43,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:02:43,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:02:43,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:02:43,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:02:43,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:02:43,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:02:43,632 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:02:43,633 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:02:43,633 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:02:43,633 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:02:43,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:02:43,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:02:43,633 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:02:43,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:02:43,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:02:43,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:02:43,833 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:02:43,834 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:02:43,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c [2022-01-10 03:02:43,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73cc83cf5/fa7f81fc07a648fbb56b031eb0ebf457/FLAG6e3843696 [2022-01-10 03:02:44,233 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:02:44,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c [2022-01-10 03:02:44,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73cc83cf5/fa7f81fc07a648fbb56b031eb0ebf457/FLAG6e3843696 [2022-01-10 03:02:44,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73cc83cf5/fa7f81fc07a648fbb56b031eb0ebf457 [2022-01-10 03:02:44,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:02:44,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:02:44,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:02:44,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:02:44,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:02:44,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1f77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44, skipping insertion in model container [2022-01-10 03:02:44,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:02:44,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:02:44,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c[576,589] [2022-01-10 03:02:44,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:02:44,461 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:02:44,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c[576,589] [2022-01-10 03:02:44,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:02:44,506 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:02:44,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44 WrapperNode [2022-01-10 03:02:44,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:02:44,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:02:44,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:02:44,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:02:44,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,534 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-01-10 03:02:44,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:02:44,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:02:44,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:02:44,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:02:44,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:02:44,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:02:44,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:02:44,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:02:44,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (1/1) ... [2022-01-10 03:02:44,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:02:44,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:02:44,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:02:44,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:02:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:02:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:02:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 03:02:44,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 03:02:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:02:44,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:02:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:02:44,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:02:44,677 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:02:44,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:02:44,842 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:02:44,871 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:02:44,871 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 03:02:44,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:02:44 BoogieIcfgContainer [2022-01-10 03:02:44,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:02:44,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:02:44,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:02:44,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:02:44,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:02:44" (1/3) ... [2022-01-10 03:02:44,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141b6fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:02:44, skipping insertion in model container [2022-01-10 03:02:44,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:44" (2/3) ... [2022-01-10 03:02:44,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141b6fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:02:44, skipping insertion in model container [2022-01-10 03:02:44,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:02:44" (3/3) ... [2022-01-10 03:02:44,877 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound1.c [2022-01-10 03:02:44,880 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:02:44,881 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:02:44,924 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:02:44,934 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:02:44,934 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:02:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:02:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 03:02:44,953 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:44,954 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:44,954 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:44,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1418986431, now seen corresponding path program 1 times [2022-01-10 03:02:44,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:44,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3779124] [2022-01-10 03:02:44,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:44,966 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:44,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:44,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:02:44,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:02:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:45,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:02:45,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:45,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:02:45,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:02:45,098 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:45,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3779124] [2022-01-10 03:02:45,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3779124] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:02:45,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:02:45,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:02:45,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873085589] [2022-01-10 03:02:45,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:02:45,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:02:45,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:45,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:02:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:02:45,129 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:02:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:45,148 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2022-01-10 03:02:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:02:45,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-01-10 03:02:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:45,157 INFO L225 Difference]: With dead ends: 65 [2022-01-10 03:02:45,157 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 03:02:45,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:02:45,164 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:45,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:02:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 03:02:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-10 03:02:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-10 03:02:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-01-10 03:02:45,198 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 24 [2022-01-10 03:02:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:45,199 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-01-10 03:02:45,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:02:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-01-10 03:02:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 03:02:45,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:45,201 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:45,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:02:45,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:02:45,408 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash 240368937, now seen corresponding path program 1 times [2022-01-10 03:02:45,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:45,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428290272] [2022-01-10 03:02:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:45,410 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:45,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:45,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:02:45,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:02:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:45,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:02:45,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 03:02:45,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:02:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 03:02:46,628 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:46,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428290272] [2022-01-10 03:02:46,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428290272] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:02:46,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:02:46,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-01-10 03:02:46,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066799347] [2022-01-10 03:02:46,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:02:46,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:02:46,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:46,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:02:46,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:02:46,631 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:02:50,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:02:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:50,491 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-01-10 03:02:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:02:50,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-01-10 03:02:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:50,493 INFO L225 Difference]: With dead ends: 49 [2022-01-10 03:02:50,493 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 03:02:50,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:02:50,494 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:50,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 125 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-01-10 03:02:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 03:02:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-01-10 03:02:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-10 03:02:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-01-10 03:02:50,502 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 24 [2022-01-10 03:02:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:50,502 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-01-10 03:02:50,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:02:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-01-10 03:02:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 03:02:50,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:50,503 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:50,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:02:50,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:02:50,711 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:50,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash -854318377, now seen corresponding path program 1 times [2022-01-10 03:02:50,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:50,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52644459] [2022-01-10 03:02:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:50,712 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:50,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:50,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:02:50,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:02:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:50,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 03:02:50,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 03:02:51,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:02:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 03:02:52,684 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:52,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52644459] [2022-01-10 03:02:52,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52644459] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:02:52,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:02:52,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-01-10 03:02:52,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152389844] [2022-01-10 03:02:52,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:02:52,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:02:52,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:02:52,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:02:52,686 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 03:02:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:54,594 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2022-01-10 03:02:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:02:54,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-01-10 03:02:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:54,603 INFO L225 Difference]: With dead ends: 67 [2022-01-10 03:02:54,603 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 03:02:54,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:02:54,604 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:54,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-10 03:02:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 03:02:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-01-10 03:02:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 states have internal predecessors, (40), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-10 03:02:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2022-01-10 03:02:54,615 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 29 [2022-01-10 03:02:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:54,616 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2022-01-10 03:02:54,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 03:02:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2022-01-10 03:02:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 03:02:54,617 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:54,617 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:54,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:02:54,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:02:54,825 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2056573358, now seen corresponding path program 1 times [2022-01-10 03:02:54,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:54,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227572958] [2022-01-10 03:02:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:54,827 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:54,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:54,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:02:54,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:02:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:54,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:02:54,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 03:02:55,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:02:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 03:02:55,481 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:55,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227572958] [2022-01-10 03:02:55,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227572958] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:02:55,482 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:02:55,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-01-10 03:02:55,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302206035] [2022-01-10 03:02:55,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:02:55,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 03:02:55,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:55,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 03:02:55,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:02:55,483 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-01-10 03:02:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:55,690 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-01-10 03:02:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 03:02:55,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 46 [2022-01-10 03:02:55,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:55,693 INFO L225 Difference]: With dead ends: 68 [2022-01-10 03:02:55,693 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 03:02:55,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:02:55,694 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:55,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 295 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-01-10 03:02:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 03:02:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-01-10 03:02:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-10 03:02:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-01-10 03:02:55,704 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 46 [2022-01-10 03:02:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:55,705 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-01-10 03:02:55,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-01-10 03:02:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-01-10 03:02:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 03:02:55,706 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:55,706 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:55,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:02:55,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:02:55,916 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2085516536, now seen corresponding path program 1 times [2022-01-10 03:02:55,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:55,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177419507] [2022-01-10 03:02:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:55,917 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:55,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:55,918 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:02:55,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:02:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:56,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 03:02:56,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-10 03:02:56,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:02:56,456 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177419507] [2022-01-10 03:02:56,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177419507] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:02:56,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:02:56,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 03:02:56,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088363218] [2022-01-10 03:02:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:02:56,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 03:02:56,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:56,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 03:02:56,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:02:56,457 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-01-10 03:02:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:56,520 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2022-01-10 03:02:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 03:02:56,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2022-01-10 03:02:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:56,520 INFO L225 Difference]: With dead ends: 101 [2022-01-10 03:02:56,521 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 03:02:56,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:02:56,522 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:56,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 189 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2022-01-10 03:02:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 03:02:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-01-10 03:02:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-10 03:02:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2022-01-10 03:02:56,528 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 52 [2022-01-10 03:02:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:56,528 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2022-01-10 03:02:56,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-01-10 03:02:56,529 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2022-01-10 03:02:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 03:02:56,530 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:56,530 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:56,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:02:56,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:02:56,747 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1724367982, now seen corresponding path program 1 times [2022-01-10 03:02:56,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:56,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600899255] [2022-01-10 03:02:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:56,748 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:56,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:56,749 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:02:56,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:02:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:56,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 03:02:56,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-01-10 03:02:57,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:03:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-01-10 03:03:07,937 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:07,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600899255] [2022-01-10 03:03:07,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600899255] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:03:07,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:03:07,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2022-01-10 03:03:07,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269231989] [2022-01-10 03:03:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:07,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 03:03:07,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:07,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 03:03:07,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-01-10 03:03:07,939 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 03:03:14,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:03:17,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:03:21,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:03:23,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:03:27,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:03:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:29,760 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2022-01-10 03:03:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 03:03:29,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 59 [2022-01-10 03:03:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:29,769 INFO L225 Difference]: With dead ends: 86 [2022-01-10 03:03:29,769 INFO L226 Difference]: Without dead ends: 83 [2022-01-10 03:03:29,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-01-10 03:03:29,770 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 17 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:29,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 207 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 69 Invalid, 5 Unknown, 0 Unchecked, 18.2s Time] [2022-01-10 03:03:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-10 03:03:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-01-10 03:03:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 47 states have internal predecessors, (51), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-01-10 03:03:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions. [2022-01-10 03:03:29,780 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 59 [2022-01-10 03:03:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:29,781 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 106 transitions. [2022-01-10 03:03:29,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 03:03:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2022-01-10 03:03:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-10 03:03:29,782 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:29,782 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:29,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:29,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:03:29,983 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash -648409701, now seen corresponding path program 2 times [2022-01-10 03:03:29,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:29,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972770725] [2022-01-10 03:03:29,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:03:29,985 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:29,985 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:03:29,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:03:30,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:03:30,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:03:30,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 03:03:30,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-01-10 03:03:31,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:31,003 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:31,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972770725] [2022-01-10 03:03:31,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972770725] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:31,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:31,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 03:03:31,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615429158] [2022-01-10 03:03:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:31,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:03:31,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:31,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:03:31,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:03:31,005 INFO L87 Difference]: Start difference. First operand 80 states and 106 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-01-10 03:03:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:31,118 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2022-01-10 03:03:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 03:03:31,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 76 [2022-01-10 03:03:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:31,118 INFO L225 Difference]: With dead ends: 93 [2022-01-10 03:03:31,118 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 03:03:31,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:03:31,120 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:31,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 168 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-01-10 03:03:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 03:03:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 03:03:31,120 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) [2022-01-10 03:03:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 03:03:31,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-01-10 03:03:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:31,121 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 03:03:31,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-01-10 03:03:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 03:03:31,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 03:03:31,123 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:03:31,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:31,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:03:31,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 03:03:54,486 WARN L228 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 36 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-10 03:03:54,488 INFO L858 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-01-10 03:03:54,488 INFO L858 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-01-10 03:03:54,489 INFO L861 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-01-10 03:03:54,489 INFO L858 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-01-10 03:03:54,489 INFO L854 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (and (= (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~r~0#1| .cse1 (bvneg |ULTIMATE.start_main_~b~0#1|)) .cse2) (= |ULTIMATE.start_main_~b~0#1| .cse0) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= .cse2 (bvadd |ULTIMATE.start_main_~r~0#1| .cse1)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)))) (bvsge |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-01-10 03:03:54,489 INFO L854 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (and (= (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~r~0#1| .cse1 (bvneg |ULTIMATE.start_main_~b~0#1|)) .cse2) (= |ULTIMATE.start_main_~b~0#1| .cse0) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= .cse2 (bvadd |ULTIMATE.start_main_~r~0#1| .cse1)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)))) (bvsge |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-01-10 03:03:54,489 INFO L858 garLoopResultBuilder]: For program point L40(lines 38 62) no Hoare annotation was computed. [2022-01-10 03:03:54,489 INFO L861 garLoopResultBuilder]: At program point L65(lines 22 66) the Hoare annotation is: true [2022-01-10 03:03:54,489 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 03:03:54,489 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 03:03:54,489 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 03:03:54,489 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (and (= (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~r~0#1| .cse1 (bvneg |ULTIMATE.start_main_~b~0#1|)) .cse2) (= |ULTIMATE.start_main_~b~0#1| .cse0) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= .cse2 (bvadd |ULTIMATE.start_main_~r~0#1| .cse1)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)))) (bvsge |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-01-10 03:03:54,489 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 03:03:54,490 INFO L854 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32))) [2022-01-10 03:03:54,490 INFO L854 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32))) [2022-01-10 03:03:54,490 INFO L858 garLoopResultBuilder]: For program point L50(lines 47 59) no Hoare annotation was computed. [2022-01-10 03:03:54,490 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse7 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (bvmul |ULTIMATE.start_main_~q~0#1| .cse7))) (let ((.cse0 (bvmul |ULTIMATE.start_main_~a~0#1| .cse7)) (.cse3 (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32))) (.cse4 (= .cse2 (bvadd |ULTIMATE.start_main_~r~0#1| .cse1)))) (or (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= (bvadd .cse0 |ULTIMATE.start_main_~r~0#1| .cse1 (bvneg |ULTIMATE.start_main_~b~0#1|)) .cse2) .cse3 .cse4 (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|))))) (and (= .cse0 |ULTIMATE.start_main_~b~0#1|) .cse3 .cse4 (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (let ((.cse6 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (.cse5 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|))) (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge .cse5 .cse6) (= |ULTIMATE.start_main_~r~0#1| (bvadd (bvneg .cse6) .cse5)))))))))) [2022-01-10 03:03:54,490 INFO L854 garLoopResultBuilder]: At program point L38-3(lines 38 62) the Hoare annotation is: (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)))) [2022-01-10 03:03:54,490 INFO L854 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: false [2022-01-10 03:03:54,490 INFO L858 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-01-10 03:03:54,490 INFO L854 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (and (= (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~r~0#1| .cse1 (bvneg |ULTIMATE.start_main_~b~0#1|)) .cse2) (= |ULTIMATE.start_main_~b~0#1| .cse0) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= .cse2 (bvadd |ULTIMATE.start_main_~r~0#1| .cse1)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)))) (bvsge |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-01-10 03:03:54,490 INFO L858 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2022-01-10 03:03:54,490 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse7 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (bvmul |ULTIMATE.start_main_~q~0#1| .cse7))) (let ((.cse0 (bvmul |ULTIMATE.start_main_~a~0#1| .cse7)) (.cse3 (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32))) (.cse4 (= .cse2 (bvadd |ULTIMATE.start_main_~r~0#1| .cse1)))) (or (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= (bvadd .cse0 |ULTIMATE.start_main_~r~0#1| .cse1 (bvneg |ULTIMATE.start_main_~b~0#1|)) .cse2) .cse3 .cse4 (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|))))) (and (= .cse0 |ULTIMATE.start_main_~b~0#1|) .cse3 .cse4 (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (let ((.cse6 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (.cse5 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|))) (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge .cse5 .cse6) (= |ULTIMATE.start_main_~r~0#1| (bvadd (bvneg .cse6) .cse5)))))))))) [2022-01-10 03:03:54,490 INFO L854 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse4 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse5 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32))) (.cse1 (= .cse4 (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse5))))) (or (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (let ((.cse3 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|))) (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge .cse2 .cse3) (= |ULTIMATE.start_main_~r~0#1| (bvadd (bvneg .cse3) .cse2)))))) (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= .cse4 (bvadd |ULTIMATE.start_main_~r~0#1| (bvneg |ULTIMATE.start_main_~b~0#1|) (bvmul .cse5 (bvadd |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~a~0#1|)))) .cse0 .cse1 (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)))))))) [2022-01-10 03:03:54,490 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-01-10 03:03:54,491 INFO L858 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-01-10 03:03:54,491 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-01-10 03:03:54,491 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-01-10 03:03:54,491 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-01-10 03:03:54,491 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-01-10 03:03:54,491 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-01-10 03:03:54,491 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-01-10 03:03:54,491 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-01-10 03:03:54,491 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-01-10 03:03:54,493 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-01-10 03:03:54,494 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:03:54,498 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,499 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,499 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,504 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:03:54 BoogieIcfgContainer [2022-01-10 03:03:54,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:03:54,508 INFO L158 Benchmark]: Toolchain (without parser) took 70253.90ms. Allocated memory was 191.9MB in the beginning and 233.8MB in the end (delta: 41.9MB). Free memory was 140.6MB in the beginning and 204.6MB in the end (delta: -64.0MB). Peak memory consumption was 104.3MB. Max. memory is 8.0GB. [2022-01-10 03:03:54,508 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:03:54,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.90ms. Allocated memory is still 191.9MB. Free memory was 140.5MB in the beginning and 167.0MB in the end (delta: -26.5MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-01-10 03:03:54,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.75ms. Allocated memory is still 191.9MB. Free memory was 167.0MB in the beginning and 165.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:03:54,508 INFO L158 Benchmark]: Boogie Preprocessor took 31.15ms. Allocated memory is still 191.9MB. Free memory was 165.6MB in the beginning and 164.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:03:54,509 INFO L158 Benchmark]: RCFGBuilder took 305.18ms. Allocated memory is still 191.9MB. Free memory was 164.6MB in the beginning and 154.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 03:03:54,509 INFO L158 Benchmark]: TraceAbstraction took 69634.03ms. Allocated memory was 191.9MB in the beginning and 233.8MB in the end (delta: 41.9MB). Free memory was 153.5MB in the beginning and 204.6MB in the end (delta: -51.1MB). Peak memory consumption was 116.7MB. Max. memory is 8.0GB. [2022-01-10 03:03:54,510 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.90ms. Allocated memory is still 191.9MB. Free memory was 140.5MB in the beginning and 167.0MB in the end (delta: -26.5MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.75ms. Allocated memory is still 191.9MB. Free memory was 167.0MB in the beginning and 165.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.15ms. Allocated memory is still 191.9MB. Free memory was 165.6MB in the beginning and 164.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 305.18ms. Allocated memory is still 191.9MB. Free memory was 164.6MB in the beginning and 154.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 69634.03ms. Allocated memory was 191.9MB in the beginning and 233.8MB in the end (delta: 41.9MB). Free memory was 153.5MB in the beginning and 204.6MB in the end (delta: -51.1MB). Peak memory consumption was 116.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] * 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: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.6s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 23.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 24.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 1162 SdHoareTripleChecker+Invalid, 23.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 89 IncrementalHoareTripleChecker+Unchecked, 900 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 262 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 468 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=6, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 69 PreInvPairs, 83 NumberOfFragments, 473 HoareAnnotationTreeSize, 69 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 108 FormulaSimplificationTreeSizeReductionInter, 23.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 457 ConstructedInterpolants, 32 QuantifiedInterpolants, 1970 SizeOfPredicates, 29 NumberOfNonLiveVariables, 540 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 546/570 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: 47]: Loop Invariant [2022-01-10 03:03:54,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] Derived loop invariant: ((((~bvadd32(~bvmul32(a, ~sign_extendFrom8To32(y)), r, ~bvmul32(q, ~sign_extendFrom8To32(y)), ~bvneg64(b)) == ~sign_extendFrom8To32(x) && b == ~sign_extendFrom8To32(y)) && ~bvsge64(y, 1bv32)) && ~sign_extendFrom8To32(x) == ~bvadd32(r, ~bvmul32(q, ~sign_extendFrom8To32(y)))) && (\exists ULTIMATE.start_main_~x~0#1 : bv32 :: (~bvsge64(ULTIMATE.start_main_~x~0#1, 0bv32) && ~bvsle32(ULTIMATE.start_main_~x~0#1, 1bv32)) && r == ~sign_extendFrom8To32(ULTIMATE.start_main_~x~0#1))) && ~bvsge64(r, ~sign_extendFrom8To32(y)) - InvariantResult [Line: 38]: Loop Invariant [2022-01-10 03:03:54,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:03:54,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] Derived loop invariant: ((((((~bvsge64(x, 0bv32) && ~bvsle32(y, 1bv32)) && ~bvsle32(x, 1bv32)) && ~bvadd32(~bvmul32(a, ~sign_extendFrom8To32(y)), r, ~bvmul32(q, ~sign_extendFrom8To32(y)), ~bvneg64(b)) == ~sign_extendFrom8To32(x)) && ~bvsge64(y, 1bv32)) && ~sign_extendFrom8To32(x) == ~bvadd32(r, ~bvmul32(q, ~sign_extendFrom8To32(y)))) && (\exists ULTIMATE.start_main_~x~0#1 : bv32 :: (~bvsge64(ULTIMATE.start_main_~x~0#1, 0bv32) && ~bvsle32(ULTIMATE.start_main_~x~0#1, 1bv32)) && r == ~sign_extendFrom8To32(ULTIMATE.start_main_~x~0#1))) || (((~bvmul32(a, ~sign_extendFrom8To32(y)) == b && ~bvsge64(y, 1bv32)) && ~sign_extendFrom8To32(x) == ~bvadd32(r, ~bvmul32(q, ~sign_extendFrom8To32(y)))) && (\exists ULTIMATE.start_main_~x~0#1 : bv32 :: (~bvsle32(ULTIMATE.start_main_~x~0#1, 1bv32) && ~bvsge64(~sign_extendFrom8To32(ULTIMATE.start_main_~x~0#1), ~sign_extendFrom8To32(y))) && r == ~bvadd32(~bvneg64(~sign_extendFrom8To32(y)), ~sign_extendFrom8To32(ULTIMATE.start_main_~x~0#1)))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 03:03:54,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...