/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/divbin_valuebound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:06:26,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:06:26,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:06:26,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:06:26,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:06:26,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:06:26,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:06:26,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:06:26,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:06:26,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:06:26,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:06:26,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:06:26,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:06:26,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:06:26,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:06:26,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:06:26,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:06:26,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:06:26,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:06:26,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:06:26,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:06:26,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:06:26,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:06:26,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:06:26,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:06:26,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:06:26,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:06:26,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:06:26,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:06:26,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:06:26,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:06:26,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:06:26,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:06:26,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:06:26,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:06:26,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:06:26,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:06:26,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:06:26,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:06:26,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:06:26,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:06:26,850 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:06:26,879 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:06:26,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:06:26,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:06:26,880 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:06:26,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:06:26,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:06:26,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:06:26,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:06:26,881 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:06:26,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:06:26,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:06:26,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:06:26,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:06:26,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:06:26,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:06:26,881 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:06:26,882 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:06:26,882 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:06:26,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:06:26,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:06:26,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:06:26,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:06:26,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:06:26,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:06:26,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:06:26,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:06:26,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:06:26,893 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:06:26,893 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:06:26,893 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:06:26,893 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:06:26,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:06:26,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:06:26,893 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:06:27,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:06:27,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:06:27,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:06:27,095 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:06:27,097 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:06:27,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound2.i [2022-01-10 03:06:27,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7203823f/092728c2f0ff4219aecbb89455fd74e8/FLAGc62c456cb [2022-01-10 03:06:27,480 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:06:27,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound2.i [2022-01-10 03:06:27,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7203823f/092728c2f0ff4219aecbb89455fd74e8/FLAGc62c456cb [2022-01-10 03:06:27,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7203823f/092728c2f0ff4219aecbb89455fd74e8 [2022-01-10 03:06:27,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:06:27,501 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:06:27,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:06:27,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:06:27,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:06:27,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:06:27" (1/1) ... [2022-01-10 03:06:27,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6025bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27, skipping insertion in model container [2022-01-10 03:06:27,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:06:27" (1/1) ... [2022-01-10 03:06:27,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:06:27,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:06:27,692 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/divbin_valuebound2.i[950,963] [2022-01-10 03:06:27,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:06:27,726 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:06:27,737 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/divbin_valuebound2.i[950,963] [2022-01-10 03:06:27,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:06:27,765 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:06:27,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27 WrapperNode [2022-01-10 03:06:27,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:06:27,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:06:27,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:06:27,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:06:27,774 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:06:27" (1/1) ... [2022-01-10 03:06:27,780 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:06:27" (1/1) ... [2022-01-10 03:06:27,793 INFO L137 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-01-10 03:06:27,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:06:27,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:06:27,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:06:27,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:06:27,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27" (1/1) ... [2022-01-10 03:06:27,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27" (1/1) ... [2022-01-10 03:06:27,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27" (1/1) ... [2022-01-10 03:06:27,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27" (1/1) ... [2022-01-10 03:06:27,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27" (1/1) ... [2022-01-10 03:06:27,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27" (1/1) ... [2022-01-10 03:06:27,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27" (1/1) ... [2022-01-10 03:06:27,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:06:27,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:06:27,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:06:27,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:06:27,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27" (1/1) ... [2022-01-10 03:06:27,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:06:27,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:06:27,863 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:06:27,884 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:06:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:06:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:06:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 03:06:27,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 03:06:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:06:27,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:06:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:06:27,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:06:27,936 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:06:27,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:06:28,037 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:06:28,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:06:28,041 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 03:06:28,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:06:28 BoogieIcfgContainer [2022-01-10 03:06:28,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:06:28,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:06:28,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:06:28,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:06:28,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:06:27" (1/3) ... [2022-01-10 03:06:28,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43abfced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:06:28, skipping insertion in model container [2022-01-10 03:06:28,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:27" (2/3) ... [2022-01-10 03:06:28,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43abfced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:06:28, skipping insertion in model container [2022-01-10 03:06:28,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:06:28" (3/3) ... [2022-01-10 03:06:28,048 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound2.i [2022-01-10 03:06:28,052 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:06:28,052 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:06:28,101 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:06:28,114 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:06:28,114 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:06:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:06:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 03:06:28,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:28,135 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:06:28,135 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash 913242413, now seen corresponding path program 1 times [2022-01-10 03:06:28,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:28,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642258743] [2022-01-10 03:06:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:28,149 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:28,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:28,151 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:06:28,152 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:06:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:28,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:06:28,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:06:28,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:06:28,320 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:28,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642258743] [2022-01-10 03:06:28,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642258743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:06:28,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:06:28,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:06:28,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080772732] [2022-01-10 03:06:28,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:06:28,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:06:28,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:28,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:06:28,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:06:28,344 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 03:06:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:28,363 INFO L93 Difference]: Finished difference Result 55 states and 84 transitions. [2022-01-10 03:06:28,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:06:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2022-01-10 03:06:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:28,369 INFO L225 Difference]: With dead ends: 55 [2022-01-10 03:06:28,369 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 03:06:28,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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:06:28,376 INFO L933 BasicCegarLoop]: 35 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, 35 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:06:28,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:06:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 03:06:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 03:06:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 03:06:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-01-10 03:06:28,408 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 30 [2022-01-10 03:06:28,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:28,409 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-01-10 03:06:28,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 03:06:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-01-10 03:06:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 03:06:28,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:28,412 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:06:28,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 03:06:28,618 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:06:28,618 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2061833476, now seen corresponding path program 1 times [2022-01-10 03:06:28,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:28,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919850900] [2022-01-10 03:06:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:28,620 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:28,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:28,623 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:06:28,625 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:06:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:28,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:06:28,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:28,916 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 03:06:28,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:06:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:06:29,275 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:29,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919850900] [2022-01-10 03:06:29,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919850900] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:06:29,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:06:29,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-01-10 03:06:29,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772238885] [2022-01-10 03:06:29,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:06:29,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:06:29,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:29,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:06:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:06:29,278 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 03:06:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:29,349 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-01-10 03:06:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:06:29,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-01-10 03:06:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:29,353 INFO L225 Difference]: With dead ends: 35 [2022-01-10 03:06:29,354 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 03:06:29,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:06:29,355 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:29,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-01-10 03:06:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 03:06:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-10 03:06:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:06:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-01-10 03:06:29,365 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2022-01-10 03:06:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:29,368 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-01-10 03:06:29,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 03:06:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-01-10 03:06:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 03:06:29,369 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:29,370 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:06:29,376 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:06:29,578 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:06:29,578 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:29,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:29,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1044269705, now seen corresponding path program 1 times [2022-01-10 03:06:29,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:29,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677545067] [2022-01-10 03:06:29,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:29,579 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:29,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:29,580 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:06:29,581 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:06:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:29,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:06:29,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 03:06:29,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:06:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 03:06:30,191 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:30,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677545067] [2022-01-10 03:06:30,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677545067] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:06:30,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:06:30,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-01-10 03:06:30,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088004193] [2022-01-10 03:06:30,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:06:30,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:06:30,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:30,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:06:30,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:06:30,193 INFO L87 Difference]: Start difference. First operand 33 states and 40 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), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 03:06:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:30,257 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-01-10 03:06:30,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:06:30,259 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), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2022-01-10 03:06:30,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:30,260 INFO L225 Difference]: With dead ends: 41 [2022-01-10 03:06:30,260 INFO L226 Difference]: Without dead ends: 39 [2022-01-10 03:06:30,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:06:30,261 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:30,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 101 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-01-10 03:06:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-10 03:06:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2022-01-10 03:06:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:06:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-01-10 03:06:30,266 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 33 [2022-01-10 03:06:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:30,266 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-01-10 03:06:30,267 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), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 03:06:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-01-10 03:06:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 03:06:30,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:30,267 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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:06:30,276 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:06:30,472 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:06:30,473 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:30,473 INFO L85 PathProgramCache]: Analyzing trace with hash -328713508, now seen corresponding path program 1 times [2022-01-10 03:06:30,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:30,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531840954] [2022-01-10 03:06:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:30,474 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:30,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:30,475 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:06:30,476 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:06:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:30,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:06:30,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:06:30,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:06:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:06:31,274 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:31,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531840954] [2022-01-10 03:06:31,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531840954] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:06:31,274 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:06:31,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-01-10 03:06:31,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789626537] [2022-01-10 03:06:31,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:06:31,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 03:06:31,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:31,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 03:06:31,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:06:31,279 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 03:06:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:31,684 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-01-10 03:06:31,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 03:06:31,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-01-10 03:06:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:31,686 INFO L225 Difference]: With dead ends: 45 [2022-01-10 03:06:31,686 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 03:06:31,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:06:31,687 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:31,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 146 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 03:06:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 03:06:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-01-10 03:06:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:06:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-01-10 03:06:31,694 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 37 [2022-01-10 03:06:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:31,694 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-01-10 03:06:31,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 03:06:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-01-10 03:06:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 03:06:31,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:31,696 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 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:06:31,713 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:06:31,903 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:06:31,904 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:31,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1786164585, now seen corresponding path program 1 times [2022-01-10 03:06:31,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:31,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115127710] [2022-01-10 03:06:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:31,905 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:31,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:31,906 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:06:31,908 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:06:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:31,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 03:06:31,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:06:32,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:06:32,005 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:32,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115127710] [2022-01-10 03:06:32,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115127710] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:06:32,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:06:32,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:06:32,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282669673] [2022-01-10 03:06:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:06:32,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 03:06:32,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:32,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 03:06:32,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:06:32,007 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:06:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:32,028 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-01-10 03:06:32,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 03:06:32,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-01-10 03:06:32,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:32,030 INFO L225 Difference]: With dead ends: 45 [2022-01-10 03:06:32,030 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 03:06:32,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:06:32,031 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:32,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:06:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 03:06:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-10 03:06:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:06:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-01-10 03:06:32,035 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 39 [2022-01-10 03:06:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:32,035 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-01-10 03:06:32,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:06:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-01-10 03:06:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 03:06:32,036 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:32,036 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-01-10 03:06:32,045 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:06:32,239 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:06:32,239 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:32,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:32,240 INFO L85 PathProgramCache]: Analyzing trace with hash 145189394, now seen corresponding path program 1 times [2022-01-10 03:06:32,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:32,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065525112] [2022-01-10 03:06:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:32,240 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:32,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:32,241 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:06:32,242 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:06:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:32,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-10 03:06:32,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 03:06:32,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:06:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:06:34,376 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:34,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065525112] [2022-01-10 03:06:34,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065525112] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:06:34,376 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:06:34,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2022-01-10 03:06:34,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887487081] [2022-01-10 03:06:34,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:06:34,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 03:06:34,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:34,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 03:06:34,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-01-10 03:06:34,377 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 7 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 03:06:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:35,380 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-01-10 03:06:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 03:06:35,382 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 7 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 41 [2022-01-10 03:06:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:35,384 INFO L225 Difference]: With dead ends: 61 [2022-01-10 03:06:35,384 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 03:06:35,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-01-10 03:06:35,385 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:35,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 222 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 163 Invalid, 0 Unknown, 15 Unchecked, 0.7s Time] [2022-01-10 03:06:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 03:06:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2022-01-10 03:06:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-10 03:06:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-01-10 03:06:35,392 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 41 [2022-01-10 03:06:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:35,392 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-01-10 03:06:35,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 7 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 03:06:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-01-10 03:06:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 03:06:35,393 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:35,394 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-01-10 03:06:35,409 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:06:35,602 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:06:35,602 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:35,603 INFO L85 PathProgramCache]: Analyzing trace with hash 202447696, now seen corresponding path program 1 times [2022-01-10 03:06:35,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:35,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965802500] [2022-01-10 03:06:35,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:35,603 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:35,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:35,604 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:06:35,605 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:06:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:35,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 03:06:35,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 03:06:35,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:06:36,205 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:36,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965802500] [2022-01-10 03:06:36,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965802500] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 03:06:36,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1798007237] [2022-01-10 03:06:36,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:36,206 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 03:06:36,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 03:06:36,207 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 03:06:36,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-01-10 03:06:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:36,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 03:06:36,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:06:37,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:06:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:06:39,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1798007237] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:06:39,510 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 03:06:39,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-01-10 03:06:39,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003534294] [2022-01-10 03:06:39,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 03:06:39,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 03:06:39,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:39,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 03:06:39,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=239, Unknown=1, NotChecked=0, Total=306 [2022-01-10 03:06:39,512 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-01-10 03:06:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:42,603 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-01-10 03:06:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 03:06:42,605 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 41 [2022-01-10 03:06:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:42,607 INFO L225 Difference]: With dead ends: 66 [2022-01-10 03:06:42,607 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 03:06:42,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=98, Invalid=361, Unknown=3, NotChecked=0, Total=462 [2022-01-10 03:06:42,608 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:42,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 145 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 18 Unchecked, 0.4s Time] [2022-01-10 03:06:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 03:06:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-01-10 03:06:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:06:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2022-01-10 03:06:42,615 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 41 [2022-01-10 03:06:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:42,615 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-01-10 03:06:42,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-01-10 03:06:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-01-10 03:06:42,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 03:06:42,616 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:42,616 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:06:42,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-01-10 03:06:42,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 03:06:43,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:06:43,018 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:43,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:43,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1669889848, now seen corresponding path program 2 times [2022-01-10 03:06:43,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:43,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285905604] [2022-01-10 03:06:43,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:06:43,019 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:43,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:43,020 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:06:43,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 03:06:43,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:06:43,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:06:43,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 03:06:43,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 03:06:43,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:06:43,578 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:43,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285905604] [2022-01-10 03:06:43,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285905604] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 03:06:43,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1985966591] [2022-01-10 03:06:43,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:06:43,578 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 03:06:43,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 03:06:43,579 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 03:06:43,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-01-10 03:06:43,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:06:43,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:06:43,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 03:06:43,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 9 refuted. 6 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 03:06:52,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:06:52,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1985966591] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 03:06:52,681 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:06:52,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2022-01-10 03:06:52,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880353508] [2022-01-10 03:06:52,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:06:52,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 03:06:52,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:52,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 03:06:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=659, Unknown=7, NotChecked=0, Total=812 [2022-01-10 03:06:52,682 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 03:06:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:52,783 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-01-10 03:06:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 03:06:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 45 [2022-01-10 03:06:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:52,784 INFO L225 Difference]: With dead ends: 84 [2022-01-10 03:06:52,784 INFO L226 Difference]: Without dead ends: 58 [2022-01-10 03:06:52,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=175, Invalid=810, Unknown=7, NotChecked=0, Total=992 [2022-01-10 03:06:52,785 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:52,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 115 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-01-10 03:06:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-10 03:06:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2022-01-10 03:06:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:06:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-01-10 03:06:52,790 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 45 [2022-01-10 03:06:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:52,790 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-01-10 03:06:52,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 03:06:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-01-10 03:06:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 03:06:52,791 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:52,791 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:06:52,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-01-10 03:06:53,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 03:06:53,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:06:53,194 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:53,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2114474925, now seen corresponding path program 3 times [2022-01-10 03:06:53,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:53,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393264109] [2022-01-10 03:06:53,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:06:53,195 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:53,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:53,196 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:06:53,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 03:06:53,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 03:06:53,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:06:53,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 03:06:53,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 03:06:53,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:06:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-01-10 03:06:53,748 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:53,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393264109] [2022-01-10 03:06:53,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393264109] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:06:53,748 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:06:53,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2022-01-10 03:06:53,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878480347] [2022-01-10 03:06:53,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:06:53,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 03:06:53,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 03:06:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:06:53,749 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-01-10 03:06:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:54,041 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-01-10 03:06:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 03:06:54,043 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 49 [2022-01-10 03:06:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:54,044 INFO L225 Difference]: With dead ends: 78 [2022-01-10 03:06:54,044 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 03:06:54,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-01-10 03:06:54,044 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:54,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 148 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:06:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 03:06:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-01-10 03:06:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:06:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-01-10 03:06:54,055 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 49 [2022-01-10 03:06:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:54,055 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-01-10 03:06:54,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-01-10 03:06:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-01-10 03:06:54,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 03:06:54,056 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:54,056 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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:06:54,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 03:06:54,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:06:54,264 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:54,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1596822888, now seen corresponding path program 4 times [2022-01-10 03:06:54,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:54,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920085673] [2022-01-10 03:06:54,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 03:06:54,264 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:54,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:54,265 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:06:54,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 03:06:54,318 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 03:06:54,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:06:54,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-10 03:06:54,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 03:06:54,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:06:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 03:06:55,593 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:55,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920085673] [2022-01-10 03:06:55,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920085673] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:06:55,593 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:06:55,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-01-10 03:06:55,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389620562] [2022-01-10 03:06:55,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:06:55,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 03:06:55,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:55,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 03:06:55,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-01-10 03:06:55,594 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 22 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-01-10 03:06:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:55,813 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-01-10 03:06:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 03:06:55,813 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 51 [2022-01-10 03:06:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:55,814 INFO L225 Difference]: With dead ends: 64 [2022-01-10 03:06:55,814 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 03:06:55,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-01-10 03:06:55,814 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:55,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 298 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2022-01-10 03:06:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 03:06:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-01-10 03:06:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:06:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-01-10 03:06:55,828 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 51 [2022-01-10 03:06:55,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:55,828 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-01-10 03:06:55,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 18 states have internal predecessors, (44), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-01-10 03:06:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-01-10 03:06:55,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 03:06:55,829 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:55,829 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:06:55,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 03:06:56,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:06:56,032 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:56,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1654081190, now seen corresponding path program 1 times [2022-01-10 03:06:56,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:56,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436915537] [2022-01-10 03:06:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:56,042 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:56,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:56,043 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:06:56,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 03:06:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:56,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 03:06:56,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 03:06:56,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:07:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 03:07:11,782 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:11,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436915537] [2022-01-10 03:07:11,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436915537] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:07:11,782 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:07:11,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2022-01-10 03:07:11,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919108290] [2022-01-10 03:07:11,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:07:11,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 03:07:11,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:11,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 03:07:11,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2022-01-10 03:07:11,784 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 22 states have internal predecessors, (51), 9 states have call successors, (13), 3 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:07:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:18,723 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-01-10 03:07:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 03:07:18,723 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 22 states have internal predecessors, (51), 9 states have call successors, (13), 3 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 51 [2022-01-10 03:07:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:18,724 INFO L225 Difference]: With dead ends: 76 [2022-01-10 03:07:18,724 INFO L226 Difference]: Without dead ends: 74 [2022-01-10 03:07:18,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 03:07:18,725 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 50 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:18,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 288 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 206 Invalid, 0 Unknown, 60 Unchecked, 2.9s Time] [2022-01-10 03:07:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-10 03:07:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2022-01-10 03:07:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 03:07:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-01-10 03:07:18,731 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 51 [2022-01-10 03:07:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:18,731 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-01-10 03:07:18,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 22 states have internal predecessors, (51), 9 states have call successors, (13), 3 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:07:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-01-10 03:07:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 03:07:18,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:18,732 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:18,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-01-10 03:07:18,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:18,941 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:18,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash 585705638, now seen corresponding path program 2 times [2022-01-10 03:07:18,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:18,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138272417] [2022-01-10 03:07:18,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:07:18,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:18,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:18,943 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:18,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 03:07:18,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:07:18,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:07:19,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 03:07:19,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 03:07:19,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:07:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-01-10 03:07:19,410 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:19,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138272417] [2022-01-10 03:07:19,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138272417] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:07:19,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:07:19,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2022-01-10 03:07:19,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137536223] [2022-01-10 03:07:19,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:19,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:07:19,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:19,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:07:19,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:07:19,412 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 03:07:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:19,456 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-01-10 03:07:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:07:19,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-01-10 03:07:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:19,457 INFO L225 Difference]: With dead ends: 78 [2022-01-10 03:07:19,457 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 03:07:19,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:07:19,457 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:19,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:07:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 03:07:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-01-10 03:07:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:07:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-01-10 03:07:19,462 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 51 [2022-01-10 03:07:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:19,462 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-01-10 03:07:19,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 03:07:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-01-10 03:07:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 03:07:19,462 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:19,462 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:19,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-01-10 03:07:19,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:19,669 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1287103, now seen corresponding path program 3 times [2022-01-10 03:07:19,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:19,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588806747] [2022-01-10 03:07:19,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:07:19,670 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:19,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:19,671 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:19,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 03:07:19,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 03:07:19,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:07:19,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 03:07:19,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 03:07:20,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:07:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 03:07:20,589 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:20,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588806747] [2022-01-10 03:07:20,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588806747] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:07:20,590 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:07:20,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2022-01-10 03:07:20,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388223499] [2022-01-10 03:07:20,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:07:20,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 03:07:20,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:20,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 03:07:20,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-01-10 03:07:20,591 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 21 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-01-10 03:07:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:21,150 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-01-10 03:07:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 03:07:21,152 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) Word has length 59 [2022-01-10 03:07:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:21,153 INFO L225 Difference]: With dead ends: 62 [2022-01-10 03:07:21,153 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 03:07:21,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2022-01-10 03:07:21,153 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 33 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:21,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 169 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 03:07:21,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 03:07:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 03:07:21,154 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:07:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 03:07:21,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2022-01-10 03:07:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:21,154 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 03:07:21,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-01-10 03:07:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 03:07:21,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 03:07:21,156 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:07:21,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 03:07:21,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:21,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 03:07:28,190 INFO L858 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-01-10 03:07:28,190 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 03:07:28,190 INFO L854 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32)) [2022-01-10 03:07:28,190 INFO L854 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (and (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32))) [2022-01-10 03:07:28,190 INFO L861 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-01-10 03:07:28,190 INFO L858 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-01-10 03:07:28,190 INFO L861 garLoopResultBuilder]: At program point L52(lines 25 53) the Hoare annotation is: true [2022-01-10 03:07:28,190 INFO L858 garLoopResultBuilder]: For program point L46(lines 46 49) no Hoare annotation was computed. [2022-01-10 03:07:28,190 INFO L858 garLoopResultBuilder]: For program point L46-2(lines 25 53) no Hoare annotation was computed. [2022-01-10 03:07:28,190 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse4 (bvult |ULTIMATE.start_main_~B~0#1| (_ bv2147483647 32))) (.cse1 (bvmul (_ bv4 32) |ULTIMATE.start_main_~B~0#1|)) (.cse6 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse7 (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse8 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse0 (exists ((|v_ULTIMATE.start_main_~b~0#1_27| (_ BitVec 32))) (= |ULTIMATE.start_main_~b~0#1| (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~b~0#1_27|)))) (.cse3 (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|))) (.cse5 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32))) (.cse2 (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)))) (or (and .cse0 (= |ULTIMATE.start_main_~b~0#1| .cse1) (bvuge |ULTIMATE.start_main_~r~0#1| .cse2) .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse4 (bvule .cse2 (_ bv2 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse5 (bvuge |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~b~0#1|) (= (bvudiv .cse1 (_ bv2 32)) |ULTIMATE.start_main_~b~0#1|)) (and (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse8 .cse6 .cse7 (bvule |ULTIMATE.start_main_~r~0#1| (_ bv2 32)) .cse5) (and .cse8 .cse3) (and .cse0 (not (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~b~0#1|)) (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|) .cse3 .cse5 (= .cse2 |ULTIMATE.start_main_~b~0#1|)))) [2022-01-10 03:07:28,190 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 41 50) no Hoare annotation was computed. [2022-01-10 03:07:28,190 INFO L858 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L854 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32))) [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L854 garLoopResultBuilder]: At program point L41-1(lines 41 50) the Hoare annotation is: (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|) [2022-01-10 03:07:28,191 INFO L854 garLoopResultBuilder]: At program point L37-2(lines 37 40) the Hoare annotation is: (let ((.cse2 (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32))) (.cse0 (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|))) (.cse1 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32)))) (or (and .cse0 (exists ((|v_ULTIMATE.start_main_~b~0#1_32| (_ BitVec 32))) (and (bvuge |ULTIMATE.start_main_~r~0#1| (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~b~0#1_32|)) (bvule |v_ULTIMATE.start_main_~b~0#1_32| (_ bv2 32)) (= |ULTIMATE.start_main_~b~0#1| (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~b~0#1_32|)))) .cse1) (and (= |ULTIMATE.start_main_~b~0#1| (bvmul (_ bv4 32) |ULTIMATE.start_main_~B~0#1|)) (bvuge |ULTIMATE.start_main_~r~0#1| .cse2) .cse0 (bvult |ULTIMATE.start_main_~B~0#1| (_ bv2147483647 32)) .cse1) (and (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|) .cse0 .cse1 (= .cse2 |ULTIMATE.start_main_~b~0#1|)) (and (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~B~0#1|) .cse0 .cse1))) [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2022-01-10 03:07:28,191 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-01-10 03:07:28,193 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:28,194 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:07:28,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:07:28 BoogieIcfgContainer [2022-01-10 03:07:28,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:07:28,207 INFO L158 Benchmark]: Toolchain (without parser) took 60706.54ms. Allocated memory was 194.0MB in the beginning and 261.1MB in the end (delta: 67.1MB). Free memory was 143.4MB in the beginning and 184.5MB in the end (delta: -41.1MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. [2022-01-10 03:07:28,208 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory is still 159.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:07:28,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.13ms. Allocated memory is still 194.0MB. Free memory was 143.3MB in the beginning and 164.8MB in the end (delta: -21.5MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-01-10 03:07:28,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.30ms. Allocated memory is still 194.0MB. Free memory was 164.8MB in the beginning and 163.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:07:28,208 INFO L158 Benchmark]: Boogie Preprocessor took 32.29ms. Allocated memory is still 194.0MB. Free memory was 163.2MB in the beginning and 162.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:07:28,208 INFO L158 Benchmark]: RCFGBuilder took 216.01ms. Allocated memory is still 194.0MB. Free memory was 161.6MB in the beginning and 152.2MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 03:07:28,209 INFO L158 Benchmark]: TraceAbstraction took 60163.26ms. Allocated memory was 194.0MB in the beginning and 261.1MB in the end (delta: 67.1MB). Free memory was 151.7MB in the beginning and 184.5MB in the end (delta: -32.8MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2022-01-10 03:07:28,209 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.12ms. Allocated memory is still 194.0MB. Free memory is still 159.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.13ms. Allocated memory is still 194.0MB. Free memory was 143.3MB in the beginning and 164.8MB in the end (delta: -21.5MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.30ms. Allocated memory is still 194.0MB. Free memory was 164.8MB in the beginning and 163.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.29ms. Allocated memory is still 194.0MB. Free memory was 163.2MB in the beginning and 162.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 216.01ms. Allocated memory is still 194.0MB. Free memory was 161.6MB in the beginning and 152.2MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 60163.26ms. Allocated memory was 194.0MB in the beginning and 261.1MB in the end (delta: 67.1MB). Free memory was 151.7MB in the beginning and 184.5MB in the end (delta: -32.8MB). Peak memory consumption was 35.3MB. 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_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~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: 21]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.1s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 1891 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 173 IncrementalHoareTripleChecker+Unchecked, 1565 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1008 IncrementalHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 326 mSDtfsCounter, 1008 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1174 GetRequests, 952 SyntacticMatches, 5 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 26.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, InterpolantAutomatonStates: 138, 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, 13 MinimizatonAttempts, 46 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 36 PreInvPairs, 51 NumberOfFragments, 251 HoareAnnotationTreeSize, 36 FomulaSimplifications, 98 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 844 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 36.3s InterpolantComputationTime, 644 NumberOfCodeBlocks, 638 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1063 ConstructedInterpolants, 77 QuantifiedInterpolants, 5019 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1094 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 708/926 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: 37]: Loop Invariant [2022-01-10 03:07:28,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,214 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_32,QUANTIFIED] [2022-01-10 03:07:28,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2022-01-10 03:07:28,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] Derived loop invariant: (((((forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd16(r, ~bvmul32(q, ULTIMATE.start_main_~b~0#1)) == A) && (\exists v_ULTIMATE.start_main_~b~0#1_32 : bv32 :: (~bvuge32(r, ~bvmul32(4bv32, v_ULTIMATE.start_main_~b~0#1_32)) && ~bvule32(v_ULTIMATE.start_main_~b~0#1_32, 2bv32)) && b == ~bvmul32(8bv32, v_ULTIMATE.start_main_~b~0#1_32))) && ~bvule32(A, 2bv32)) || ((((b == ~bvmul32(4bv32, B) && ~bvuge32(r, ~bvmul32(B, 2bv32))) && (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd16(r, ~bvmul32(q, ULTIMATE.start_main_~b~0#1)) == A)) && ~bvult64(B, 2147483647bv32)) && ~bvule32(A, 2bv32))) || (((~bvuge32(r, B) && (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd16(r, ~bvmul32(q, ULTIMATE.start_main_~b~0#1)) == A)) && ~bvule32(A, 2bv32)) && ~bvmul32(B, 2bv32) == b)) || (((~bvule32(b, 2bv32) && b == B) && (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd16(r, ~bvmul32(q, ULTIMATE.start_main_~b~0#1)) == A)) && ~bvule32(A, 2bv32)) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 03:07:28,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...