/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 17:39:08,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 17:39:08,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 17:39:08,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 17:39:08,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 17:39:08,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 17:39:08,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 17:39:08,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 17:39:08,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 17:39:08,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 17:39:08,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 17:39:08,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 17:39:08,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 17:39:08,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 17:39:08,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 17:39:08,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 17:39:08,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 17:39:08,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 17:39:08,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 17:39:08,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 17:39:08,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 17:39:08,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 17:39:08,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 17:39:08,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 17:39:08,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 17:39:08,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 17:39:08,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 17:39:08,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 17:39:08,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 17:39:08,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 17:39:08,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 17:39:08,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 17:39:08,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 17:39:08,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 17:39:08,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 17:39:08,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 17:39:08,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 17:39:08,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 17:39:08,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 17:39:08,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 17:39:08,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 17:39:08,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-02 17:39:08,858 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 17:39:08,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 17:39:08,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 17:39:08,859 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 17:39:08,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 17:39:08,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 17:39:08,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 17:39:08,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 17:39:08,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 17:39:08,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 17:39:08,860 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 17:39:08,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 17:39:08,860 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 17:39:08,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 17:39:08,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 17:39:08,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 17:39:08,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 17:39:08,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 17:39:08,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 17:39:08,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 17:39:08,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 17:39:08,862 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-02 17:39:08,862 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 17:39:09,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 17:39:09,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 17:39:09,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 17:39:09,112 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 17:39:09,113 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 17:39:09,113 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 17:39:09,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca8b3e9d/3e4411fad8da4e00a66875e1cb4e953e/FLAG2f17c618e [2021-05-02 17:39:09,512 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 17:39:09,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2021-05-02 17:39:09,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca8b3e9d/3e4411fad8da4e00a66875e1cb4e953e/FLAG2f17c618e [2021-05-02 17:39:09,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca8b3e9d/3e4411fad8da4e00a66875e1cb4e953e [2021-05-02 17:39:09,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 17:39:09,943 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-02 17:39:09,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 17:39:09,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 17:39:09,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 17:39:09,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 05:39:09" (1/1) ... [2021-05-02 17:39:09,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74c26932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:09, skipping insertion in model container [2021-05-02 17:39:09,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 05:39:09" (1/1) ... [2021-05-02 17:39:09,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 17:39:09,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 17:39:10,041 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 17:39:10,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 17:39:10,056 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 17:39:10,064 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 17:39:10,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 17:39:10,081 INFO L208 MainTranslator]: Completed translation [2021-05-02 17:39:10,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:10 WrapperNode [2021-05-02 17:39:10,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 17:39:10,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 17:39:10,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 17:39:10,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 17:39:10,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:10" (1/1) ... [2021-05-02 17:39:10,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:10" (1/1) ... [2021-05-02 17:39:10,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:10" (1/1) ... [2021-05-02 17:39:10,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:10" (1/1) ... [2021-05-02 17:39:10,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:10" (1/1) ... [2021-05-02 17:39:10,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:10" (1/1) ... [2021-05-02 17:39:10,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:10" (1/1) ... [2021-05-02 17:39:10,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 17:39:10,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 17:39:10,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 17:39:10,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 17:39:10,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:10" (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 17:39:10,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 17:39:10,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 17:39:10,223 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 17:39:10,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 17:39:10,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 17:39:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 17:39:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 17:39:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 17:39:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 17:39:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 17:39:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 17:39:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 17:39:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-02 17:39:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 17:39:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 17:39:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 17:39:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 17:39:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 17:39:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 17:39:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 17:39:10,382 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 17:39:10,383 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 17:39:10,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:39:10 BoogieIcfgContainer [2021-05-02 17:39:10,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 17:39:10,384 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-02 17:39:10,384 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-02 17:39:10,384 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-02 17:39:10,386 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:39:10" (1/1) ... [2021-05-02 17:39:10,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 05:39:10 BasicIcfg [2021-05-02 17:39:10,404 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-02 17:39:10,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 17:39:10,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 17:39:10,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 17:39:10,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 05:39:09" (1/4) ... [2021-05-02 17:39:10,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5502cfc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 05:39:10, skipping insertion in model container [2021-05-02 17:39:10,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 05:39:10" (2/4) ... [2021-05-02 17:39:10,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5502cfc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 05:39:10, skipping insertion in model container [2021-05-02 17:39:10,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 05:39:10" (3/4) ... [2021-05-02 17:39:10,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5502cfc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 05:39:10, skipping insertion in model container [2021-05-02 17:39:10,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 05:39:10" (4/4) ... [2021-05-02 17:39:10,409 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-1.iJordan [2021-05-02 17:39:10,412 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-02 17:39:10,423 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 17:39:10,433 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 17:39:10,450 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 17:39:10,450 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-02 17:39:10,450 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-02 17:39:10,450 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 17:39:10,450 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 17:39:10,450 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 17:39:10,450 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 17:39:10,451 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 17:39:10,470 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 17:39:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 17:39:10,477 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:39:10,477 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:39:10,478 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:39:10,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:39:10,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1546198667, now seen corresponding path program 1 times [2021-05-02 17:39:10,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:39:10,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40060901] [2021-05-02 17:39:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:39:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:10,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:39:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:10,794 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 17:39:10,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:39:10,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40060901] [2021-05-02 17:39:10,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40060901] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 17:39:10,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 17:39:10,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 17:39:10,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651363647] [2021-05-02 17:39:10,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 17:39:10,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:39:10,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 17:39:10,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-05-02 17:39:10,808 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 17:39:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:39:11,080 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2021-05-02 17:39:11,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 17:39:11,081 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 17:39:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:39:11,086 INFO L225 Difference]: With dead ends: 27 [2021-05-02 17:39:11,087 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 17:39:11,090 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 251.4ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-05-02 17:39:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 17:39:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2021-05-02 17:39:11,111 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 17:39:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-05-02 17:39:11,113 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2021-05-02 17:39:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:39:11,113 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-05-02 17:39:11,114 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 17:39:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-05-02 17:39:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 17:39:11,115 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:39:11,115 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 17:39:11,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 17:39:11,115 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:39:11,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:39:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash 35168483, now seen corresponding path program 1 times [2021-05-02 17:39:11,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:39:11,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136430498] [2021-05-02 17:39:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:39:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:11,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:39:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:11,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 17:39:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:11,348 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 17:39:11,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:39:11,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136430498] [2021-05-02 17:39:11,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136430498] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:11,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187166512] [2021-05-02 17:39:11,349 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 17:39:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:11,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 23 conjunts are in the unsatisfiable core [2021-05-02 17:39:11,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:39:11,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:11,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:11,650 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:11,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:11,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:11,707 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 17:39:11,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187166512] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:11,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:39:11,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-05-02 17:39:11,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60006665] [2021-05-02 17:39:11,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 17:39:11,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:39:11,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 17:39:11,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-05-02 17:39:11,713 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 17:39:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:39:12,095 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-05-02 17:39:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 17:39:12,096 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 17:39:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:39:12,098 INFO L225 Difference]: With dead ends: 39 [2021-05-02 17:39:12,099 INFO L226 Difference]: Without dead ends: 39 [2021-05-02 17:39:12,101 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 442.3ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-05-02 17:39:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-02 17:39:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-05-02 17:39:12,111 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 17:39:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-05-02 17:39:12,112 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2021-05-02 17:39:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:39:12,112 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-05-02 17:39:12,112 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 17:39:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2021-05-02 17:39:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-02 17:39:12,113 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:39:12,113 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 17:39:12,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-05-02 17:39:12,329 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:39:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:39:12,330 INFO L82 PathProgramCache]: Analyzing trace with hash -407833038, now seen corresponding path program 1 times [2021-05-02 17:39:12,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:39:12,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038027293] [2021-05-02 17:39:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:39:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:12,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:39:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:12,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 17:39:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:12,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 17:39:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:12,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 17:39:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:12,421 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 17:39:12,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:39:12,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038027293] [2021-05-02 17:39:12,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038027293] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:12,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353559925] [2021-05-02 17:39:12,428 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 17:39:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:12,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-02 17:39:12,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:39:12,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:12,484 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:12,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:12,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:12,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:12,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:12,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:12,543 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 17:39:12,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353559925] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:12,543 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:39:12,544 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-05-02 17:39:12,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630032798] [2021-05-02 17:39:12,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 17:39:12,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:39:12,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 17:39:12,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 17:39:12,545 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 17:39:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:39:12,669 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2021-05-02 17:39:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 17:39:12,670 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 17:39:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:39:12,671 INFO L225 Difference]: With dead ends: 43 [2021-05-02 17:39:12,671 INFO L226 Difference]: Without dead ends: 43 [2021-05-02 17:39:12,671 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 104.4ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-02 17:39:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-02 17:39:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-05-02 17:39:12,674 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 17:39:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-05-02 17:39:12,675 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 37 [2021-05-02 17:39:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:39:12,675 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-05-02 17:39:12,675 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 17:39:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-05-02 17:39:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 17:39:12,676 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:39:12,676 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 17:39:12,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:39:12,892 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:39:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:39:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1750397066, now seen corresponding path program 2 times [2021-05-02 17:39:12,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:39:12,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948255427] [2021-05-02 17:39:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:39:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:13,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:39:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:13,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 17:39:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:13,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 17:39:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:13,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 17:39:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:13,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 17:39:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:13,223 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 17:39:13,223 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:39:13,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948255427] [2021-05-02 17:39:13,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948255427] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:13,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126888135] [2021-05-02 17:39:13,224 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 17:39:13,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 17:39:13,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:39:13,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-02 17:39:13,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:39:13,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:13,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:13,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:13,341 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:13,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:13,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:13,379 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:13,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:13,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:13,414 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 17:39:13,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126888135] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:13,415 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:39:13,415 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-05-02 17:39:13,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954015519] [2021-05-02 17:39:13,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 17:39:13,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:39:13,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 17:39:13,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-05-02 17:39:13,420 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 17:39:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:39:13,752 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2021-05-02 17:39:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 17:39:13,757 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 17:39:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:39:13,758 INFO L225 Difference]: With dead ends: 47 [2021-05-02 17:39:13,758 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 17:39:13,758 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 268.4ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-05-02 17:39:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 17:39:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-05-02 17:39:13,761 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 17:39:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2021-05-02 17:39:13,762 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 45 [2021-05-02 17:39:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:39:13,762 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2021-05-02 17:39:13,762 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 17:39:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2021-05-02 17:39:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 17:39:13,763 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:39:13,763 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 17:39:13,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:39:13,969 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:39:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:39:13,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1642402530, now seen corresponding path program 3 times [2021-05-02 17:39:13,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:39:13,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793166926] [2021-05-02 17:39:13,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:39:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:14,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:39:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:14,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 17:39:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:14,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 17:39:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:14,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 17:39:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:14,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 17:39:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:14,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 17:39:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:14,256 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 17:39:14,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:39:14,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793166926] [2021-05-02 17:39:14,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793166926] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:14,258 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450578544] [2021-05-02 17:39:14,258 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 17:39:14,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-05-02 17:39:14,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:39:14,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjunts are in the unsatisfiable core [2021-05-02 17:39:14,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:39:14,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,656 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,670 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,692 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:14,708 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 17:39:14,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450578544] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:14,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:39:14,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2021-05-02 17:39:14,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472791300] [2021-05-02 17:39:14,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 17:39:14,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:39:14,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 17:39:14,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-05-02 17:39:14,710 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 17:39:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:39:15,080 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2021-05-02 17:39:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 17:39:15,080 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 17:39:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:39:15,081 INFO L225 Difference]: With dead ends: 51 [2021-05-02 17:39:15,081 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 17:39:15,081 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 251.1ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-05-02 17:39:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 17:39:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2021-05-02 17:39:15,084 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 17:39:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2021-05-02 17:39:15,085 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 53 [2021-05-02 17:39:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:39:15,085 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2021-05-02 17:39:15,085 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 17:39:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2021-05-02 17:39:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-02 17:39:15,086 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:39:15,086 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 17:39:15,289 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:39:15,290 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:39:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:39:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash -642163398, now seen corresponding path program 4 times [2021-05-02 17:39:15,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:39:15,290 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45977754] [2021-05-02 17:39:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:39:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:15,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:39:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:15,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 17:39:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:15,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 17:39:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:15,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 17:39:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:15,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 17:39:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:15,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 17:39:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:15,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-05-02 17:39:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:15,516 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 17:39:15,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:39:15,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45977754] [2021-05-02 17:39:15,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45977754] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:15,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983436674] [2021-05-02 17:39:15,517 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 17:39:15,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 17:39:15,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:39:15,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjunts are in the unsatisfiable core [2021-05-02 17:39:15,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:39:15,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,631 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,678 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,716 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,729 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:15,736 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 17:39:15,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983436674] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:15,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:39:15,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2021-05-02 17:39:15,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677793604] [2021-05-02 17:39:15,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 17:39:15,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:39:15,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 17:39:15,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-05-02 17:39:15,742 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 17:39:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:39:15,997 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2021-05-02 17:39:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 17:39:15,998 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 17:39:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:39:16,001 INFO L225 Difference]: With dead ends: 55 [2021-05-02 17:39:16,001 INFO L226 Difference]: Without dead ends: 55 [2021-05-02 17:39:16,002 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 211.4ms TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-05-02 17:39:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-02 17:39:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2021-05-02 17:39:16,016 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 17:39:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2021-05-02 17:39:16,018 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 61 [2021-05-02 17:39:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:39:16,019 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2021-05-02 17:39:16,020 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 17:39:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2021-05-02 17:39:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-02 17:39:16,022 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:39:16,022 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 17:39:16,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-05-02 17:39:16,240 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:39:16,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:39:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash -47591534, now seen corresponding path program 5 times [2021-05-02 17:39:16,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:39:16,241 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122401455] [2021-05-02 17:39:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:39:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:16,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:39:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:16,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 17:39:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:16,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 17:39:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:16,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 17:39:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:16,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 17:39:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:16,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 17:39:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:16,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-05-02 17:39:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:16,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-02 17:39:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:16,379 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 17:39:16,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:39:16,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122401455] [2021-05-02 17:39:16,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122401455] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:16,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313667291] [2021-05-02 17:39:16,380 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 17:39:16,993 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-05-02 17:39:16,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:39:16,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 17:39:16,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:39:17,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,049 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,064 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,079 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,092 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,114 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,144 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:17,150 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 17:39:17,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313667291] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:17,150 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:39:17,150 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2021-05-02 17:39:17,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245636965] [2021-05-02 17:39:17,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 17:39:17,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:39:17,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 17:39:17,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-05-02 17:39:17,152 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 17:39:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:39:17,436 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2021-05-02 17:39:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 17:39:17,437 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 17:39:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:39:17,439 INFO L225 Difference]: With dead ends: 59 [2021-05-02 17:39:17,439 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 17:39:17,439 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 217.3ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-05-02 17:39:17,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 17:39:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-05-02 17:39:17,449 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 17:39:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2021-05-02 17:39:17,451 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 69 [2021-05-02 17:39:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:39:17,451 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2021-05-02 17:39:17,451 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 17:39:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2021-05-02 17:39:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 17:39:17,453 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:39:17,453 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 17:39:17,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:39:17,657 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:39:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:39:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash 562981354, now seen corresponding path program 6 times [2021-05-02 17:39:17,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:39:17,658 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611783438] [2021-05-02 17:39:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:39:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:17,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:39:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:17,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 17:39:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:17,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 17:39:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:17,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 17:39:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:17,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 17:39:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:17,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 17:39:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:17,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-05-02 17:39:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:17,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-02 17:39:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:17,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-05-02 17:39:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:17,808 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 17:39:17,808 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:39:17,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611783438] [2021-05-02 17:39:17,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611783438] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:17,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127878244] [2021-05-02 17:39:17,808 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 17:39:18,101 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-05-02 17:39:18,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 17:39:18,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 22 conjunts are in the unsatisfiable core [2021-05-02 17:39:18,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:39:18,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,170 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,185 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:18,256 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 17:39:18,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127878244] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:18,256 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:39:18,256 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2021-05-02 17:39:18,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093385628] [2021-05-02 17:39:18,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 17:39:18,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:39:18,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 17:39:18,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-05-02 17:39:18,257 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 17:39:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:39:18,604 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2021-05-02 17:39:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 17:39:18,606 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 17:39:18,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:39:18,607 INFO L225 Difference]: With dead ends: 63 [2021-05-02 17:39:18,607 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 17:39:18,607 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 227.2ms TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-05-02 17:39:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 17:39:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-05-02 17:39:18,609 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 17:39:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2021-05-02 17:39:18,610 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 77 [2021-05-02 17:39:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:39:18,610 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2021-05-02 17:39:18,610 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 17:39:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2021-05-02 17:39:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-02 17:39:18,611 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:39:18,611 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 17:39:18,814 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 17:39:18,815 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:39:18,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:39:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1002492862, now seen corresponding path program 7 times [2021-05-02 17:39:18,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:39:18,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779706781] [2021-05-02 17:39:18,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:39:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 17:39:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-05-02 17:39:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 17:39:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 17:39:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 17:39:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 17:39:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-05-02 17:39:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-02 17:39:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-05-02 17:39:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-05-02 17:39:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:18,993 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 17:39:18,993 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 17:39:18,993 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779706781] [2021-05-02 17:39:18,993 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779706781] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:18,993 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468520301] [2021-05-02 17:39:18,993 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 17:39:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 17:39:19,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 17:39:19,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 17:39:19,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,058 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,069 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,070 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,096 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,097 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,121 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,145 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,167 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 17:39:19,184 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 17:39:19,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468520301] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 17:39:19,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 17:39:19,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2021-05-02 17:39:19,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274406714] [2021-05-02 17:39:19,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 17:39:19,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 17:39:19,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 17:39:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-05-02 17:39:19,187 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 17:39:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 17:39:19,592 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2021-05-02 17:39:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 17:39:19,593 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 17:39:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 17:39:19,593 INFO L225 Difference]: With dead ends: 67 [2021-05-02 17:39:19,593 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 17:39:19,594 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 269.0ms TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2021-05-02 17:39:19,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 17:39:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-05-02 17:39:19,596 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 17:39:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2021-05-02 17:39:19,597 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 85 [2021-05-02 17:39:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 17:39:19,597 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2021-05-02 17:39:19,597 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 17:39:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2021-05-02 17:39:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 17:39:19,598 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 17:39:19,598 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 17:39:19,804 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-02 17:39:19,805 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 17:39:19,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 17:39:19,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1970006374, now seen corresponding path program 8 times [2021-05-02 17:39:19,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 17:39:19,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203500482] [2021-05-02 17:39:19,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 17:39:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 17:39:19,880 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 17:39:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 17:39:19,912 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 17:39:19,931 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 17:39:19,931 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 17:39:19,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 17:39:19,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 05:39:19 BasicIcfg [2021-05-02 17:39:19,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 17:39:19,958 INFO L168 Benchmark]: Toolchain (without parser) took 10015.42 ms. Allocated memory was 228.6 MB in the beginning and 281.0 MB in the end (delta: 52.4 MB). Free memory was 193.2 MB in the beginning and 238.6 MB in the end (delta: -45.4 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-05-02 17:39:19,958 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 228.6 MB. Free memory is still 209.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 17:39:19,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.40 ms. Allocated memory is still 228.6 MB. Free memory was 192.9 MB in the beginning and 183.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-02 17:39:19,958 INFO L168 Benchmark]: Boogie Preprocessor took 66.15 ms. Allocated memory is still 228.6 MB. Free memory was 183.6 MB in the beginning and 211.7 MB in the end (delta: -28.2 MB). Peak memory consumption was 5.9 MB. Max. memory is 8.0 GB. [2021-05-02 17:39:19,958 INFO L168 Benchmark]: RCFGBuilder took 233.57 ms. Allocated memory is still 228.6 MB. Free memory was 211.7 MB in the beginning and 197.6 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-05-02 17:39:19,958 INFO L168 Benchmark]: IcfgTransformer took 19.92 ms. Allocated memory is still 228.6 MB. Free memory was 197.6 MB in the beginning and 196.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 17:39:19,958 INFO L168 Benchmark]: TraceAbstraction took 9552.53 ms. Allocated memory was 228.6 MB in the beginning and 281.0 MB in the end (delta: 52.4 MB). Free memory was 196.0 MB in the beginning and 238.6 MB in the end (delta: -42.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 8.0 GB. [2021-05-02 17:39:19,958 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.46 ms. Allocated memory is still 228.6 MB. Free memory is still 209.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 137.40 ms. Allocated memory is still 228.6 MB. Free memory was 192.9 MB in the beginning and 183.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 66.15 ms. Allocated memory is still 228.6 MB. Free memory was 183.6 MB in the beginning and 211.7 MB in the end (delta: -28.2 MB). Peak memory consumption was 5.9 MB. Max. memory is 8.0 GB. * RCFGBuilder took 233.57 ms. Allocated memory is still 228.6 MB. Free memory was 211.7 MB in the beginning and 197.6 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * IcfgTransformer took 19.92 ms. Allocated memory is still 228.6 MB. Free memory was 197.6 MB in the beginning and 196.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9552.53 ms. Allocated memory was 228.6 MB in the beginning and 281.0 MB in the end (delta: 52.4 MB). Free memory was 196.0 MB in the beginning and 238.6 MB in the end (delta: -42.6 MB). Peak memory consumption was 9.9 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 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9488.1ms, OverallIterations: 10, TraceHistogramMax: 11, EmptinessCheckTime: 30.7ms, AutomataDifference: 2824.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 190 SDtfs, 283 SDslu, 383 SDs, 0 SdLazy, 1973 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1179.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 697 GetRequests, 531 SyntacticMatches, 17 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2243.0ms 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: 68.8ms AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 97.8ms SsaConstructionTime, 1430.9ms SatisfiabilityAnalysisTime, 2936.2ms 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...