/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 11:51:37,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 11:51:37,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 11:51:37,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 11:51:37,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 11:51:37,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 11:51:37,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 11:51:37,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 11:51:37,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 11:51:37,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 11:51:37,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 11:51:37,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 11:51:37,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 11:51:37,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 11:51:37,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 11:51:37,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 11:51:37,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 11:51:37,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 11:51:37,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 11:51:37,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 11:51:37,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 11:51:37,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 11:51:37,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 11:51:37,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 11:51:37,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 11:51:37,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 11:51:37,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 11:51:37,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 11:51:37,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 11:51:37,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 11:51:37,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 11:51:37,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 11:51:37,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 11:51:37,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 11:51:37,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 11:51:37,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 11:51:37,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 11:51:37,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 11:51:37,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 11:51:37,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 11:51:37,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 11:51:37,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 11:51:37,915 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 11:51:37,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 11:51:37,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 11:51:37,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 11:51:37,917 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 11:51:37,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 11:51:37,917 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 11:51:37,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 11:51:37,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 11:51:37,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 11:51:37,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 11:51:37,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 11:51:37,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 11:51:37,918 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 11:51:37,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 11:51:37,918 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 11:51:37,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 11:51:37,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 11:51:37,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 11:51:37,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 11:51:37,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 11:51:37,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 11:51:37,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 11:51:37,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 11:51:37,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 11:51:37,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 11:51:37,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 11:51:37,919 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 11:51:37,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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; [2021-05-02 11:51:38,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 11:51:38,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 11:51:38,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 11:51:38,262 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 11:51:38,262 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 11:51:38,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2021-05-02 11:51:38,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4565a592e/0bbe866e51cc4684a7c0046e08b88208/FLAG3006871a9 [2021-05-02 11:51:38,644 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 11:51:38,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2021-05-02 11:51:38,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4565a592e/0bbe866e51cc4684a7c0046e08b88208/FLAG3006871a9 [2021-05-02 11:51:38,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4565a592e/0bbe866e51cc4684a7c0046e08b88208 [2021-05-02 11:51:38,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 11:51:38,661 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 11:51:38,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 11:51:38,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 11:51:38,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 11:51:38,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:51:38" (1/1) ... [2021-05-02 11:51:38,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2337d58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38, skipping insertion in model container [2021-05-02 11:51:38,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:51:38" (1/1) ... [2021-05-02 11:51:38,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 11:51:38,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 11:51:38,759 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2021-05-02 11:51:38,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 11:51:38,771 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 11:51:38,778 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2021-05-02 11:51:38,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 11:51:38,789 INFO L208 MainTranslator]: Completed translation [2021-05-02 11:51:38,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38 WrapperNode [2021-05-02 11:51:38,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 11:51:38,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 11:51:38,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 11:51:38,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 11:51:38,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38" (1/1) ... [2021-05-02 11:51:38,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38" (1/1) ... [2021-05-02 11:51:38,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38" (1/1) ... [2021-05-02 11:51:38,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38" (1/1) ... [2021-05-02 11:51:38,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38" (1/1) ... [2021-05-02 11:51:38,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38" (1/1) ... [2021-05-02 11:51:38,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38" (1/1) ... [2021-05-02 11:51:38,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 11:51:38,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 11:51:38,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 11:51:38,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 11:51:38,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 11:51:38,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 11:51:38,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 11:51:38,899 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 11:51:38,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 11:51:38,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 11:51:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 11:51:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 11:51:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 11:51:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 11:51:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 11:51:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 11:51:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 11:51:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-02 11:51:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 11:51:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 11:51:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 11:51:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 11:51:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 11:51:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 11:51:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 11:51:39,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 11:51:39,105 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 11:51:39,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:51:39 BoogieIcfgContainer [2021-05-02 11:51:39,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 11:51:39,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 11:51:39,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 11:51:39,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 11:51:39,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:51:38" (1/3) ... [2021-05-02 11:51:39,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436e0f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:51:39, skipping insertion in model container [2021-05-02 11:51:39,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:51:38" (2/3) ... [2021-05-02 11:51:39,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436e0f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:51:39, skipping insertion in model container [2021-05-02 11:51:39,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:51:39" (3/3) ... [2021-05-02 11:51:39,111 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2021-05-02 11:51:39,114 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 11:51:39,117 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 11:51:39,128 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 11:51:39,157 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 11:51:39,157 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 11:51:39,157 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 11:51:39,157 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 11:51:39,157 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 11:51:39,157 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 11:51:39,157 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 11:51:39,158 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 11:51:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 11:51:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 11:51:39,170 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:39,171 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:39,171 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:39,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1946695220, now seen corresponding path program 1 times [2021-05-02 11:51:39,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:39,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869289417] [2021-05-02 11:51:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:39,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:51:39,571 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:51:39,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869289417] [2021-05-02 11:51:39,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869289417] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:51:39,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:51:39,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 11:51:39,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179151633] [2021-05-02 11:51:39,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 11:51:39,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:51:39,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 11:51:39,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-05-02 11:51:39,584 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:51:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:39,888 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2021-05-02 11:51:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 11:51:39,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-02 11:51:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:39,894 INFO L225 Difference]: With dead ends: 41 [2021-05-02 11:51:39,894 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 11:51:39,897 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 289.7ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-05-02 11:51:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 11:51:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2021-05-02 11:51:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 11:51:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-05-02 11:51:39,928 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2021-05-02 11:51:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:39,929 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-05-02 11:51:39,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 11:51:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-05-02 11:51:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 11:51:39,930 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:39,930 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:39,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 11:51:39,931 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:39,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:39,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1052577873, now seen corresponding path program 1 times [2021-05-02 11:51:39,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:39,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339441545] [2021-05-02 11:51:39,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:40,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:40,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 11:51:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:51:40,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:51:40,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339441545] [2021-05-02 11:51:40,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339441545] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:40,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379236297] [2021-05-02 11:51:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:40,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 23 conjunts are in the unsatisfiable core [2021-05-02 11:51:40,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:51:40,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:40,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:40,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:40,359 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:40,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:51:40,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379236297] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:40,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:51:40,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-05-02 11:51:40,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991583788] [2021-05-02 11:51:40,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 11:51:40,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:51:40,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 11:51:40,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-05-02 11:51:40,397 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 11:51:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:40,823 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2021-05-02 11:51:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 11:51:40,824 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2021-05-02 11:51:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:40,826 INFO L225 Difference]: With dead ends: 49 [2021-05-02 11:51:40,826 INFO L226 Difference]: Without dead ends: 39 [2021-05-02 11:51:40,827 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 426.6ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-05-02 11:51:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-02 11:51:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-05-02 11:51:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 11:51:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-05-02 11:51:40,844 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2021-05-02 11:51:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:40,844 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-05-02 11:51:40,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 11:51:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2021-05-02 11:51:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-02 11:51:40,853 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:40,853 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:41,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-05-02 11:51:41,068 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:41,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:41,069 INFO L82 PathProgramCache]: Analyzing trace with hash -668913975, now seen corresponding path program 1 times [2021-05-02 11:51:41,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:41,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414430470] [2021-05-02 11:51:41,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 11:51:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 11:51:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 11:51:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 11:51:41,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:51:41,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414430470] [2021-05-02 11:51:41,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414430470] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:41,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652712372] [2021-05-02 11:51:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-02 11:51:41,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:51:41,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:41,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:41,294 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:41,296 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:41,320 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:41,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:41,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 11:51:41,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652712372] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:41,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:51:41,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-05-02 11:51:41,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860796496] [2021-05-02 11:51:41,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 11:51:41,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:51:41,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 11:51:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 11:51:41,348 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 11:51:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:41,528 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2021-05-02 11:51:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 11:51:41,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 37 [2021-05-02 11:51:41,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:41,529 INFO L225 Difference]: With dead ends: 53 [2021-05-02 11:51:41,529 INFO L226 Difference]: Without dead ends: 43 [2021-05-02 11:51:41,529 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 148.4ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-02 11:51:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-02 11:51:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-05-02 11:51:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 11:51:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-05-02 11:51:41,535 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 37 [2021-05-02 11:51:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:41,535 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-05-02 11:51:41,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-02 11:51:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-05-02 11:51:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 11:51:41,536 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:41,537 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:41,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:41,754 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash -505363994, now seen corresponding path program 2 times [2021-05-02 11:51:41,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:41,755 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909163384] [2021-05-02 11:51:41,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 11:51:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 11:51:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 11:51:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 11:51:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-02 11:51:41,877 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:51:41,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909163384] [2021-05-02 11:51:41,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909163384] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:41,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623370078] [2021-05-02 11:51:41,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:41,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 11:51:41,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:51:41,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-02 11:51:41,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:51:41,966 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:41,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,005 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,030 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,064 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,066 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-02 11:51:42,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623370078] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:42,099 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:51:42,099 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-05-02 11:51:42,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466335861] [2021-05-02 11:51:42,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 11:51:42,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:51:42,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 11:51:42,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-05-02 11:51:42,101 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 11:51:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:42,265 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2021-05-02 11:51:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 11:51:42,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2021-05-02 11:51:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:42,268 INFO L225 Difference]: With dead ends: 57 [2021-05-02 11:51:42,268 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 11:51:42,269 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 123.6ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-05-02 11:51:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 11:51:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-05-02 11:51:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-02 11:51:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2021-05-02 11:51:42,275 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 45 [2021-05-02 11:51:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:42,275 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2021-05-02 11:51:42,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 11:51:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2021-05-02 11:51:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 11:51:42,276 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:42,276 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:42,481 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:42,481 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash -736237565, now seen corresponding path program 3 times [2021-05-02 11:51:42,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:42,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592686953] [2021-05-02 11:51:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:42,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:42,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 11:51:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:42,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 11:51:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:42,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 11:51:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:42,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 11:51:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:42,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 11:51:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-05-02 11:51:42,627 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:51:42,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592686953] [2021-05-02 11:51:42,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592686953] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:42,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135262457] [2021-05-02 11:51:42,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:42,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-05-02 11:51:42,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:51:42,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjunts are in the unsatisfiable core [2021-05-02 11:51:42,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:51:42,834 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,853 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,910 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-05-02 11:51:42,930 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135262457] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:42,930 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:51:42,930 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2021-05-02 11:51:42,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861774627] [2021-05-02 11:51:42,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 11:51:42,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:51:42,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 11:51:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-05-02 11:51:42,931 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-02 11:51:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:43,127 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-05-02 11:51:43,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 11:51:43,127 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 53 [2021-05-02 11:51:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:43,128 INFO L225 Difference]: With dead ends: 61 [2021-05-02 11:51:43,128 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 11:51:43,128 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 147.4ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-05-02 11:51:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 11:51:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2021-05-02 11:51:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 11:51:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2021-05-02 11:51:43,134 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 53 [2021-05-02 11:51:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:43,134 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2021-05-02 11:51:43,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 8 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-02 11:51:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2021-05-02 11:51:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-02 11:51:43,135 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:43,135 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:43,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:43,343 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:43,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:43,344 INFO L82 PathProgramCache]: Analyzing trace with hash 764780832, now seen corresponding path program 4 times [2021-05-02 11:51:43,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:43,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575745353] [2021-05-02 11:51:43,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:43,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:43,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 11:51:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:43,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 11:51:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:43,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 11:51:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:43,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 11:51:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:43,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 11:51:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:43,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-05-02 11:51:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-05-02 11:51:43,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:51:43,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575745353] [2021-05-02 11:51:43,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575745353] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:43,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890289153] [2021-05-02 11:51:43,482 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:43,526 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 11:51:43,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:51:43,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjunts are in the unsatisfiable core [2021-05-02 11:51:43,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:51:43,546 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,559 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,577 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,592 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,606 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-05-02 11:51:43,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890289153] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:43,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:51:43,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2021-05-02 11:51:43,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253508032] [2021-05-02 11:51:43,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 11:51:43,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:51:43,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 11:51:43,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-05-02 11:51:43,649 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 11:51:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:43,912 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2021-05-02 11:51:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 11:51:43,912 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 61 [2021-05-02 11:51:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:43,914 INFO L225 Difference]: With dead ends: 65 [2021-05-02 11:51:43,914 INFO L226 Difference]: Without dead ends: 55 [2021-05-02 11:51:43,914 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 166.8ms TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-05-02 11:51:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-02 11:51:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2021-05-02 11:51:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-05-02 11:51:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2021-05-02 11:51:43,928 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 61 [2021-05-02 11:51:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:43,928 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2021-05-02 11:51:43,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 11:51:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2021-05-02 11:51:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-02 11:51:43,929 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:43,929 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:44,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-05-02 11:51:44,145 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:44,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:44,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1610935613, now seen corresponding path program 5 times [2021-05-02 11:51:44,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:44,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037617710] [2021-05-02 11:51:44,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:44,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:44,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 11:51:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:44,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 11:51:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:44,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 11:51:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:44,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 11:51:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:44,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 11:51:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:44,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-05-02 11:51:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:44,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-02 11:51:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-05-02 11:51:44,298 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:51:44,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037617710] [2021-05-02 11:51:44,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037617710] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:44,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674982437] [2021-05-02 11:51:44,298 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:44,864 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-05-02 11:51:44,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:51:44,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 11:51:44,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:51:44,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,915 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,931 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,944 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,945 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,970 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,992 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:44,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:45,005 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-05-02 11:51:45,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674982437] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:45,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:51:45,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2021-05-02 11:51:45,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708917324] [2021-05-02 11:51:45,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 11:51:45,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:51:45,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 11:51:45,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-05-02 11:51:45,014 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 10 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-05-02 11:51:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:45,324 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2021-05-02 11:51:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 11:51:45,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 10 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 69 [2021-05-02 11:51:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:45,325 INFO L225 Difference]: With dead ends: 69 [2021-05-02 11:51:45,325 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 11:51:45,325 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 232.4ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-05-02 11:51:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 11:51:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-05-02 11:51:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-02 11:51:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2021-05-02 11:51:45,330 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 69 [2021-05-02 11:51:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:45,331 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2021-05-02 11:51:45,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 10 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-05-02 11:51:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2021-05-02 11:51:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 11:51:45,332 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:45,332 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:45,543 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:45,543 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:45,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:45,543 INFO L82 PathProgramCache]: Analyzing trace with hash -802632614, now seen corresponding path program 6 times [2021-05-02 11:51:45,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:45,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304686690] [2021-05-02 11:51:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:45,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:45,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 11:51:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:45,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 11:51:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:45,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 11:51:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:45,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 11:51:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:45,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 11:51:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:45,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-05-02 11:51:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:45,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-02 11:51:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:45,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-05-02 11:51:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-05-02 11:51:45,703 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:51:45,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304686690] [2021-05-02 11:51:45,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304686690] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:45,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692433756] [2021-05-02 11:51:45,703 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:45,991 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-05-02 11:51:45,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:51:45,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 22 conjunts are in the unsatisfiable core [2021-05-02 11:51:45,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:51:46,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,041 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,042 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,058 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,059 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,070 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-05-02 11:51:46,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692433756] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:46,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:51:46,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2021-05-02 11:51:46,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286416885] [2021-05-02 11:51:46,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 11:51:46,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:51:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 11:51:46,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-05-02 11:51:46,135 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 11 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-02 11:51:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:46,497 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2021-05-02 11:51:46,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 11:51:46,497 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 11 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 77 [2021-05-02 11:51:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:46,498 INFO L225 Difference]: With dead ends: 73 [2021-05-02 11:51:46,498 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 11:51:46,498 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 233.2ms TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-05-02 11:51:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 11:51:46,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-05-02 11:51:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-05-02 11:51:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2021-05-02 11:51:46,504 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 77 [2021-05-02 11:51:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:46,504 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2021-05-02 11:51:46,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 11 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-02 11:51:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2021-05-02 11:51:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-02 11:51:46,505 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:46,505 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:46,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:46,710 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:46,717 INFO L82 PathProgramCache]: Analyzing trace with hash -708952457, now seen corresponding path program 7 times [2021-05-02 11:51:46,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:46,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023339663] [2021-05-02 11:51:46,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 11:51:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 11:51:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 11:51:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 11:51:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 11:51:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-05-02 11:51:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-02 11:51:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-05-02 11:51:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-05-02 11:51:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-05-02 11:51:46,886 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:51:46,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023339663] [2021-05-02 11:51:46,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023339663] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:46,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219675757] [2021-05-02 11:51:46,887 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:46,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 11:51:46,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:51:46,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,977 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:46,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,001 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,014 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,015 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,061 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,070 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-05-02 11:51:47,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219675757] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:47,077 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:51:47,077 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2021-05-02 11:51:47,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993226675] [2021-05-02 11:51:47,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 11:51:47,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:51:47,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 11:51:47,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-05-02 11:51:47,080 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-05-02 11:51:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:47,514 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2021-05-02 11:51:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 11:51:47,515 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 85 [2021-05-02 11:51:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:47,518 INFO L225 Difference]: With dead ends: 77 [2021-05-02 11:51:47,518 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 11:51:47,518 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 268.1ms TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2021-05-02 11:51:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 11:51:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-05-02 11:51:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-02 11:51:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2021-05-02 11:51:47,543 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 85 [2021-05-02 11:51:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:47,544 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2021-05-02 11:51:47,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-05-02 11:51:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2021-05-02 11:51:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 11:51:47,549 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:47,549 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:47,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-02 11:51:47,765 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:47,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1149090924, now seen corresponding path program 8 times [2021-05-02 11:51:47,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:47,765 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865647480] [2021-05-02 11:51:47,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 11:51:47,803 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 11:51:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 11:51:47,854 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 11:51:47,871 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 11:51:47,872 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 11:51:47,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 11:51:47,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:51:47 BoogieIcfgContainer [2021-05-02 11:51:47,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 11:51:47,922 INFO L168 Benchmark]: Toolchain (without parser) took 9261.56 ms. Allocated memory was 200.3 MB in the beginning and 374.3 MB in the end (delta: 174.1 MB). Free memory was 164.6 MB in the beginning and 322.8 MB in the end (delta: -158.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 8.0 GB. [2021-05-02 11:51:47,922 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 200.3 MB. Free memory is still 181.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 11:51:47,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 127.48 ms. Allocated memory is still 200.3 MB. Free memory was 164.4 MB in the beginning and 155.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-02 11:51:47,923 INFO L168 Benchmark]: Boogie Preprocessor took 44.34 ms. Allocated memory is still 200.3 MB. Free memory was 155.0 MB in the beginning and 184.1 MB in the end (delta: -29.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 8.0 GB. [2021-05-02 11:51:47,923 INFO L168 Benchmark]: RCFGBuilder took 270.83 ms. Allocated memory is still 200.3 MB. Free memory was 184.1 MB in the beginning and 170.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-05-02 11:51:47,923 INFO L168 Benchmark]: TraceAbstraction took 8815.04 ms. Allocated memory was 200.3 MB in the beginning and 374.3 MB in the end (delta: 174.1 MB). Free memory was 170.5 MB in the beginning and 322.8 MB in the end (delta: -152.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 8.0 GB. [2021-05-02 11:51:47,924 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.09 ms. Allocated memory is still 200.3 MB. Free memory is still 181.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 127.48 ms. Allocated memory is still 200.3 MB. Free memory was 164.4 MB in the beginning and 155.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.34 ms. Allocated memory is still 200.3 MB. Free memory was 155.0 MB in the beginning and 184.1 MB in the end (delta: -29.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 270.83 ms. Allocated memory is still 200.3 MB. Free memory was 184.1 MB in the beginning and 170.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8815.04 ms. Allocated memory was 200.3 MB in the beginning and 374.3 MB in the end (delta: 174.1 MB). Free memory was 170.5 MB in the beginning and 322.8 MB in the end (delta: -152.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int sn=0; [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L23] unsigned int x=0; VAL [loop1=52, n1=54, sn=0, x=0] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=0, x=0] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=52, n1=54, sn=2, x=0] [L28] x++ VAL [loop1=52, n1=54, sn=2, x=1] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=52, n1=54, sn=2, x=1] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=2, x=1] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=52, n1=54, sn=4, x=1] [L28] x++ VAL [loop1=52, n1=54, sn=4, x=2] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=52, n1=54, sn=4, x=2] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=4, x=2] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=52, n1=54, sn=6, x=2] [L28] x++ VAL [loop1=52, n1=54, sn=6, x=3] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=52, n1=54, sn=6, x=3] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=6, x=3] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=52, n1=54, sn=8, x=3] [L28] x++ VAL [loop1=52, n1=54, sn=8, x=4] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=52, n1=54, sn=8, x=4] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=8, x=4] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=52, n1=54, sn=10, x=4] [L28] x++ VAL [loop1=52, n1=54, sn=10, x=5] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=52, n1=54, sn=10, x=5] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=10, x=5] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=52, n1=54, sn=12, x=5] [L28] x++ VAL [loop1=52, n1=54, sn=12, x=6] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=52, n1=54, sn=12, x=6] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=12, x=6] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=52, n1=54, sn=14, x=6] [L28] x++ VAL [loop1=52, n1=54, sn=14, x=7] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=52, n1=54, sn=14, x=7] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=14, x=7] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=52, n1=54, sn=16, x=7] [L28] x++ VAL [loop1=52, n1=54, sn=16, x=8] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=52, n1=54, sn=16, x=8] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=16, x=8] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=52, n1=54, sn=18, x=8] [L28] x++ VAL [loop1=52, n1=54, sn=18, x=9] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=52, n1=54, sn=18, x=9] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=18, x=9] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=52, n1=54, sn=20, x=9] [L28] x++ VAL [loop1=52, n1=54, sn=20, x=10] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=52, n1=54, sn=20, x=10] [L24] COND TRUE 1 VAL [loop1=52, n1=54, sn=20, x=10] [L25] COND FALSE !(x<10) VAL [loop1=52, n1=54, sn=20, x=10] [L28] x++ VAL [loop1=52, n1=54, sn=20, x=11] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L15] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8716.8ms, OverallIterations: 10, TraceHistogramMax: 11, EmptinessCheckTime: 22.4ms, AutomataDifference: 2680.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 190 SDtfs, 284 SDslu, 386 SDs, 0 SdLazy, 1964 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 986.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 697 GetRequests, 531 SyntacticMatches, 17 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2036.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=9, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 104.8ms AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 78.5ms SsaConstructionTime, 1270.3ms SatisfiabilityAnalysisTime, 2493.3ms InterpolantComputationTime, 1002 NumberOfCodeBlocks, 1002 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 3472 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1287 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 1291/2420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...