/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 13:33:40,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 13:33:40,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 13:33:40,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 13:33:40,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 13:33:40,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 13:33:40,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 13:33:40,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 13:33:40,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 13:33:40,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 13:33:40,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 13:33:40,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 13:33:40,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 13:33:40,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 13:33:40,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 13:33:40,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 13:33:40,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 13:33:40,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 13:33:40,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 13:33:40,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 13:33:40,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 13:33:40,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 13:33:40,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 13:33:40,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 13:33:40,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 13:33:40,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 13:33:40,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 13:33:40,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 13:33:40,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 13:33:40,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 13:33:40,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 13:33:40,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 13:33:40,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 13:33:40,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 13:33:40,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 13:33:40,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 13:33:40,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 13:33:40,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 13:33:40,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 13:33:40,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 13:33:40,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 13:33:40,646 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 13:33:40,679 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 13:33:40,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 13:33:40,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 13:33:40,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 13:33:40,681 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 13:33:40,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 13:33:40,681 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 13:33:40,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 13:33:40,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 13:33:40,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 13:33:40,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 13:33:40,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 13:33:40,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 13:33:40,682 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 13:33:40,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 13:33:40,682 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 13:33:40,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 13:33:40,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 13:33:40,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 13:33:40,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 13:33:40,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 13:33:40,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 13:33:40,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 13:33:40,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 13:33:40,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 13:33:40,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 13:33:40,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 13:33:40,683 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 13:33:40,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 13:33:40,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 13:33:40,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 13:33:40,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 13:33:40,972 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 13:33:40,972 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 13:33:40,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_4.c [2021-05-02 13:33:41,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d022a3d/db7ae98da7114e3aaf65b92736a0d3a8/FLAG60a047cba [2021-05-02 13:33:41,400 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 13:33:41,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_4.c [2021-05-02 13:33:41,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d022a3d/db7ae98da7114e3aaf65b92736a0d3a8/FLAG60a047cba [2021-05-02 13:33:41,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d022a3d/db7ae98da7114e3aaf65b92736a0d3a8 [2021-05-02 13:33:41,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 13:33:41,425 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 13:33:41,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 13:33:41,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 13:33:41,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 13:33:41,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 01:33:41" (1/1) ... [2021-05-02 13:33:41,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7723703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41, skipping insertion in model container [2021-05-02 13:33:41,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 01:33:41" (1/1) ... [2021-05-02 13:33:41,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 13:33:41,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 13:33:41,559 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_4.c[841,854] [2021-05-02 13:33:41,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 13:33:41,569 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 13:33:41,588 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_4.c[841,854] [2021-05-02 13:33:41,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 13:33:41,603 INFO L208 MainTranslator]: Completed translation [2021-05-02 13:33:41,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41 WrapperNode [2021-05-02 13:33:41,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 13:33:41,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 13:33:41,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 13:33:41,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 13:33:41,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41" (1/1) ... [2021-05-02 13:33:41,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41" (1/1) ... [2021-05-02 13:33:41,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41" (1/1) ... [2021-05-02 13:33:41,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41" (1/1) ... [2021-05-02 13:33:41,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41" (1/1) ... [2021-05-02 13:33:41,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41" (1/1) ... [2021-05-02 13:33:41,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41" (1/1) ... [2021-05-02 13:33:41,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 13:33:41,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 13:33:41,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 13:33:41,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 13:33:41,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41" (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 13:33:41,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 13:33:41,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 13:33:41,713 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 13:33:41,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 13:33:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 13:33:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 13:33:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 13:33:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 13:33:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 13:33:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 13:33:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 13:33:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 13:33:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 13:33:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 13:33:41,919 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 13:33:41,919 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-05-02 13:33:41,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 01:33:41 BoogieIcfgContainer [2021-05-02 13:33:41,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 13:33:41,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 13:33:41,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 13:33:41,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 13:33:41,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 01:33:41" (1/3) ... [2021-05-02 13:33:41,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d363eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 01:33:41, skipping insertion in model container [2021-05-02 13:33:41,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:33:41" (2/3) ... [2021-05-02 13:33:41,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d363eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 01:33:41, skipping insertion in model container [2021-05-02 13:33:41,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 01:33:41" (3/3) ... [2021-05-02 13:33:41,924 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_4.c [2021-05-02 13:33:41,928 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 13:33:41,930 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 13:33:41,941 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 13:33:41,960 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 13:33:41,961 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 13:33:41,961 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 13:33:41,964 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 13:33:41,964 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 13:33:41,964 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 13:33:41,964 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 13:33:41,964 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 13:33:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 13:33:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-05-02 13:33:41,984 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:41,985 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:41,985 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:41,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1467912619, now seen corresponding path program 1 times [2021-05-02 13:33:41,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:41,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585158361] [2021-05-02 13:33:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,192 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 13:33:42,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:42,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585158361] [2021-05-02 13:33:42,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585158361] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:33:42,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:33:42,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 13:33:42,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098521347] [2021-05-02 13:33:42,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 13:33:42,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:42,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 13:33:42,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 13:33:42,207 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:42,239 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2021-05-02 13:33:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 13:33:42,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-05-02 13:33:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:42,247 INFO L225 Difference]: With dead ends: 38 [2021-05-02 13:33:42,247 INFO L226 Difference]: Without dead ends: 17 [2021-05-02 13:33:42,249 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 13:33:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-02 13:33:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-02 13:33:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-05-02 13:33:42,272 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2021-05-02 13:33:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:42,272 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-05-02 13:33:42,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-05-02 13:33:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-05-02 13:33:42,273 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:42,273 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:42,273 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 13:33:42,273 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:42,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1467952981, now seen corresponding path program 1 times [2021-05-02 13:33:42,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:42,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620356866] [2021-05-02 13:33:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,358 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 13:33:42,358 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:42,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620356866] [2021-05-02 13:33:42,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620356866] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:33:42,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:33:42,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 13:33:42,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158855292] [2021-05-02 13:33:42,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 13:33:42,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:42,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 13:33:42,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 13:33:42,360 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:42,445 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-05-02 13:33:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 13:33:42,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-05-02 13:33:42,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:42,447 INFO L225 Difference]: With dead ends: 28 [2021-05-02 13:33:42,447 INFO L226 Difference]: Without dead ends: 25 [2021-05-02 13:33:42,447 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 13:33:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-02 13:33:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2021-05-02 13:33:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2021-05-02 13:33:42,452 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2021-05-02 13:33:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:42,452 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-05-02 13:33:42,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2021-05-02 13:33:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-02 13:33:42,453 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:42,453 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:42,453 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 13:33:42,453 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash -408278750, now seen corresponding path program 1 times [2021-05-02 13:33:42,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:42,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200962306] [2021-05-02 13:33:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:33:42,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:42,547 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200962306] [2021-05-02 13:33:42,547 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200962306] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:33:42,547 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:33:42,547 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 13:33:42,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372403619] [2021-05-02 13:33:42,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 13:33:42,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:42,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 13:33:42,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 13:33:42,548 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:42,619 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2021-05-02 13:33:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 13:33:42,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-02 13:33:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:42,620 INFO L225 Difference]: With dead ends: 35 [2021-05-02 13:33:42,621 INFO L226 Difference]: Without dead ends: 24 [2021-05-02 13:33:42,621 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 13:33:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-05-02 13:33:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2021-05-02 13:33:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2021-05-02 13:33:42,626 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2021-05-02 13:33:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:42,626 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-05-02 13:33:42,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2021-05-02 13:33:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 13:33:42,627 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:42,627 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:42,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 13:33:42,627 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:42,628 INFO L82 PathProgramCache]: Analyzing trace with hash 675904015, now seen corresponding path program 1 times [2021-05-02 13:33:42,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:42,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624126528] [2021-05-02 13:33:42,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:33:42,674 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:42,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624126528] [2021-05-02 13:33:42,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624126528] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:33:42,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:33:42,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 13:33:42,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895085305] [2021-05-02 13:33:42,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 13:33:42,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:42,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 13:33:42,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 13:33:42,676 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:42,720 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-05-02 13:33:42,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 13:33:42,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 13:33:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:42,721 INFO L225 Difference]: With dead ends: 35 [2021-05-02 13:33:42,721 INFO L226 Difference]: Without dead ends: 23 [2021-05-02 13:33:42,722 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 13:33:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-02 13:33:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2021-05-02 13:33:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-05-02 13:33:42,729 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2021-05-02 13:33:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:42,729 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-05-02 13:33:42,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-05-02 13:33:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 13:33:42,730 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:42,730 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:42,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 13:33:42,730 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:42,731 INFO L82 PathProgramCache]: Analyzing trace with hash 919301982, now seen corresponding path program 1 times [2021-05-02 13:33:42,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:42,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258400852] [2021-05-02 13:33:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:33:42,812 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:42,812 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258400852] [2021-05-02 13:33:42,812 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258400852] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:33:42,812 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:33:42,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 13:33:42,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777784070] [2021-05-02 13:33:42,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 13:33:42,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:42,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 13:33:42,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 13:33:42,814 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:42,885 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2021-05-02 13:33:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 13:33:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 13:33:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:42,886 INFO L225 Difference]: With dead ends: 35 [2021-05-02 13:33:42,886 INFO L226 Difference]: Without dead ends: 22 [2021-05-02 13:33:42,886 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 13:33:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-05-02 13:33:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-05-02 13:33:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2021-05-02 13:33:42,890 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2021-05-02 13:33:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:42,891 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2021-05-02 13:33:42,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2021-05-02 13:33:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 13:33:42,891 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:42,891 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:42,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 13:33:42,891 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:42,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1380235844, now seen corresponding path program 1 times [2021-05-02 13:33:42,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:42,892 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652415494] [2021-05-02 13:33:42,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:33:42,947 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:42,947 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652415494] [2021-05-02 13:33:42,947 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652415494] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:42,947 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251822929] [2021-05-02 13:33:42,947 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 13:33:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:43,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2021-05-02 13:33:43,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:43,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:43,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:33:43,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251822929] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:43,109 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:43,109 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-05-02 13:33:43,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268012428] [2021-05-02 13:33:43,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 13:33:43,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:43,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 13:33:43,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-02 13:33:43,112 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 2 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 13:33:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:43,203 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2021-05-02 13:33:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 13:33:43,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 2 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 20 [2021-05-02 13:33:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:43,204 INFO L225 Difference]: With dead ends: 38 [2021-05-02 13:33:43,204 INFO L226 Difference]: Without dead ends: 24 [2021-05-02 13:33:43,204 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 71.9ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-05-02 13:33:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-05-02 13:33:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-05-02 13:33:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2021-05-02 13:33:43,208 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2021-05-02 13:33:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:43,208 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-05-02 13:33:43,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 2 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 13:33:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2021-05-02 13:33:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 13:33:43,209 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:43,209 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:43,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-05-02 13:33:43,425 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:43,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:43,425 INFO L82 PathProgramCache]: Analyzing trace with hash 672070810, now seen corresponding path program 2 times [2021-05-02 13:33:43,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:43,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381927086] [2021-05-02 13:33:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:43,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-02 13:33:43,472 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:43,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381927086] [2021-05-02 13:33:43,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381927086] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:43,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870961768] [2021-05-02 13:33:43,472 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 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 13:33:43,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:33:43,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:43,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-02 13:33:43,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:43,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:43,547 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:43,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:43,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:33:43,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870961768] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:43,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:43,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-05-02 13:33:43,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5074046] [2021-05-02 13:33:43,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 13:33:43,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:43,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 13:33:43,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 13:33:43,594 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (3), 2 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 13:33:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:43,910 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2021-05-02 13:33:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 13:33:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (3), 2 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 22 [2021-05-02 13:33:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:43,911 INFO L225 Difference]: With dead ends: 61 [2021-05-02 13:33:43,911 INFO L226 Difference]: Without dead ends: 45 [2021-05-02 13:33:43,912 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 262.6ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-05-02 13:33:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-02 13:33:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-05-02 13:33:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-02 13:33:43,918 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 22 [2021-05-02 13:33:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:43,919 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-02 13:33:43,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (3), 2 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 13:33:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-02 13:33:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 13:33:43,919 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:43,919 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:44,128 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:44,129 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:44,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:44,130 INFO L82 PathProgramCache]: Analyzing trace with hash 350851119, now seen corresponding path program 3 times [2021-05-02 13:33:44,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:44,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285166021] [2021-05-02 13:33:44,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:44,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-05-02 13:33:44,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:44,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285166021] [2021-05-02 13:33:44,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285166021] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:44,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900881236] [2021-05-02 13:33:44,178 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 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 13:33:44,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-05-02 13:33:44,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:44,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2021-05-02 13:33:44,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:44,260 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:44,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-05-02 13:33:44,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900881236] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:44,272 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:44,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2021-05-02 13:33:44,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804253786] [2021-05-02 13:33:44,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 13:33:44,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:44,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 13:33:44,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 13:33:44,277 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 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 13:33:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:44,510 INFO L93 Difference]: Finished difference Result 231 states and 269 transitions. [2021-05-02 13:33:44,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 13:33:44,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 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 33 [2021-05-02 13:33:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:44,512 INFO L225 Difference]: With dead ends: 231 [2021-05-02 13:33:44,512 INFO L226 Difference]: Without dead ends: 204 [2021-05-02 13:33:44,512 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 160.6ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-05-02 13:33:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-05-02 13:33:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 100. [2021-05-02 13:33:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.15625) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2021-05-02 13:33:44,527 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 33 [2021-05-02 13:33:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:44,527 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2021-05-02 13:33:44,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 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 13:33:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2021-05-02 13:33:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-02 13:33:44,529 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:44,529 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 8, 8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:44,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:44,741 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1810799115, now seen corresponding path program 4 times [2021-05-02 13:33:44,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:44,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172121703] [2021-05-02 13:33:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:44,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 193 proven. 9 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-05-02 13:33:44,837 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:44,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172121703] [2021-05-02 13:33:44,838 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172121703] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:44,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848156639] [2021-05-02 13:33:44,838 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 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 13:33:44,902 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 13:33:44,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:44,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-02 13:33:44,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:44,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:44,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:44,936 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:44,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:44,946 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:44,948 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 193 proven. 9 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-05-02 13:33:45,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848156639] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:45,031 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:45,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-05-02 13:33:45,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408929106] [2021-05-02 13:33:45,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 13:33:45,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:45,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 13:33:45,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-05-02 13:33:45,034 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 2 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 13:33:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:45,183 INFO L93 Difference]: Finished difference Result 208 states and 243 transitions. [2021-05-02 13:33:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 13:33:45,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 2 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 99 [2021-05-02 13:33:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:45,185 INFO L225 Difference]: With dead ends: 208 [2021-05-02 13:33:45,185 INFO L226 Difference]: Without dead ends: 124 [2021-05-02 13:33:45,186 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 111.5ms TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2021-05-02 13:33:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-05-02 13:33:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2021-05-02 13:33:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.1339285714285714) internal successors, (127), 112 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2021-05-02 13:33:45,215 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 99 [2021-05-02 13:33:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:45,216 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2021-05-02 13:33:45,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 2 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 13:33:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2021-05-02 13:33:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-05-02 13:33:45,219 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:45,220 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 8, 8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:45,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:45,436 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:45,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:45,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1755066101, now seen corresponding path program 5 times [2021-05-02 13:33:45,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:45,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752202146] [2021-05-02 13:33:45,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:45,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 305 proven. 16 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2021-05-02 13:33:45,552 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:45,552 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752202146] [2021-05-02 13:33:45,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752202146] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:45,552 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568145942] [2021-05-02 13:33:45,552 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 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 13:33:45,590 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-05-02 13:33:45,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:45,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-02 13:33:45,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:45,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:45,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:45,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:45,654 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:45,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:45,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:45,665 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:45,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 754 proven. 16 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2021-05-02 13:33:45,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568145942] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:45,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:45,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-05-02 13:33:45,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866012053] [2021-05-02 13:33:45,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 13:33:45,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:45,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 13:33:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-05-02 13:33:45,735 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (3), 2 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 13:33:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:45,894 INFO L93 Difference]: Finished difference Result 238 states and 273 transitions. [2021-05-02 13:33:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 13:33:45,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (3), 2 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 115 [2021-05-02 13:33:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:45,898 INFO L225 Difference]: With dead ends: 238 [2021-05-02 13:33:45,898 INFO L226 Difference]: Without dead ends: 140 [2021-05-02 13:33:45,900 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 118.4ms TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-05-02 13:33:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-05-02 13:33:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2021-05-02 13:33:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.1171875) internal successors, (143), 128 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2021-05-02 13:33:45,917 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 115 [2021-05-02 13:33:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:45,918 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2021-05-02 13:33:45,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (3), 2 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 13:33:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2021-05-02 13:33:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-02 13:33:45,920 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:45,920 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 8, 8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:46,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-02 13:33:46,137 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash 429066251, now seen corresponding path program 6 times [2021-05-02 13:33:46,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:46,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924313297] [2021-05-02 13:33:46,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:46,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 445 proven. 25 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2021-05-02 13:33:46,212 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:46,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924313297] [2021-05-02 13:33:46,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924313297] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:46,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590026544] [2021-05-02 13:33:46,212 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 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 13:33:46,269 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2021-05-02 13:33:46,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:46,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 13:33:46,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:46,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,335 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,340 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,342 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,347 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 1094 proven. 25 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2021-05-02 13:33:46,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590026544] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:46,416 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:46,416 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2021-05-02 13:33:46,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37389536] [2021-05-02 13:33:46,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 13:33:46,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:46,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 13:33:46,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-05-02 13:33:46,419 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 2 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 13:33:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:46,590 INFO L93 Difference]: Finished difference Result 260 states and 295 transitions. [2021-05-02 13:33:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 13:33:46,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 2 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 131 [2021-05-02 13:33:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:46,591 INFO L225 Difference]: With dead ends: 260 [2021-05-02 13:33:46,591 INFO L226 Difference]: Without dead ends: 148 [2021-05-02 13:33:46,591 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 148.2ms TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2021-05-02 13:33:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-05-02 13:33:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-05-02 13:33:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 144 states have (on average 1.1041666666666667) internal successors, (159), 144 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2021-05-02 13:33:46,601 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 131 [2021-05-02 13:33:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:46,601 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2021-05-02 13:33:46,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 2 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 13:33:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2021-05-02 13:33:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-05-02 13:33:46,602 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:46,603 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 8, 8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:46,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:46,817 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:46,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:46,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2064892149, now seen corresponding path program 7 times [2021-05-02 13:33:46,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:46,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995989081] [2021-05-02 13:33:46,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:46,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2787 backedges. 1066 proven. 89 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2021-05-02 13:33:46,893 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:46,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995989081] [2021-05-02 13:33:46,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995989081] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:46,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889832802] [2021-05-02 13:33:46,893 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 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 13:33:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:46,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-02 13:33:46,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:46,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:46,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:47,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:47,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2787 backedges. 1066 proven. 89 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2021-05-02 13:33:47,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889832802] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:47,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:47,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-05-02 13:33:47,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232829486] [2021-05-02 13:33:47,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 13:33:47,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:47,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 13:33:47,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 13:33:47,096 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 2 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 13:33:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:47,194 INFO L93 Difference]: Finished difference Result 373 states and 410 transitions. [2021-05-02 13:33:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 13:33:47,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 2 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 147 [2021-05-02 13:33:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:47,196 INFO L225 Difference]: With dead ends: 373 [2021-05-02 13:33:47,196 INFO L226 Difference]: Without dead ends: 264 [2021-05-02 13:33:47,196 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 63.6ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-05-02 13:33:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-05-02 13:33:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 208. [2021-05-02 13:33:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 204 states have (on average 1.0931372549019607) internal successors, (223), 204 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2021-05-02 13:33:47,212 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 147 [2021-05-02 13:33:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:47,213 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2021-05-02 13:33:47,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 2 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 13:33:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2021-05-02 13:33:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-05-02 13:33:47,215 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:47,215 INFO L523 BasicCegarLoop]: trace histogram [72, 72, 12, 12, 12, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:47,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:47,429 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:47,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash -509085365, now seen corresponding path program 8 times [2021-05-02 13:33:47,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:47,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865057736] [2021-05-02 13:33:47,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:47,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6253 backedges. 2377 proven. 264 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2021-05-02 13:33:47,504 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:47,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865057736] [2021-05-02 13:33:47,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865057736] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:47,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420238658] [2021-05-02 13:33:47,504 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 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 13:33:47,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:33:47,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:47,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-02 13:33:47,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:47,623 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:47,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:47,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:47,650 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:47,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:47,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6253 backedges. 2377 proven. 264 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2021-05-02 13:33:47,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420238658] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:47,793 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:47,793 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-05-02 13:33:47,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143392586] [2021-05-02 13:33:47,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 13:33:47,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:47,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 13:33:47,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-05-02 13:33:47,795 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 2 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 13:33:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:47,951 INFO L93 Difference]: Finished difference Result 478 states and 522 transitions. [2021-05-02 13:33:47,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 13:33:47,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 2 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 207 [2021-05-02 13:33:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:47,953 INFO L225 Difference]: With dead ends: 478 [2021-05-02 13:33:47,953 INFO L226 Difference]: Without dead ends: 324 [2021-05-02 13:33:47,954 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 94.0ms TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2021-05-02 13:33:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-05-02 13:33:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 268. [2021-05-02 13:33:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 264 states have (on average 1.0871212121212122) internal successors, (287), 264 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2021-05-02 13:33:47,977 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 207 [2021-05-02 13:33:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:47,977 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2021-05-02 13:33:47,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 2 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 13:33:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2021-05-02 13:33:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-05-02 13:33:47,979 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:47,979 INFO L523 BasicCegarLoop]: trace histogram [96, 96, 16, 16, 16, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:48,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-05-02 13:33:48,193 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:48,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1725424757, now seen corresponding path program 9 times [2021-05-02 13:33:48,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:48,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560219633] [2021-05-02 13:33:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:48,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11111 backedges. 4210 proven. 526 refuted. 0 times theorem prover too weak. 6375 trivial. 0 not checked. [2021-05-02 13:33:48,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:48,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560219633] [2021-05-02 13:33:48,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560219633] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:48,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552989702] [2021-05-02 13:33:48,271 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:48,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2021-05-02 13:33:48,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:48,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-02 13:33:48,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:48,563 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:48,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:48,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:48,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:48,600 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:48,601 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:48,632 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:48,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11111 backedges. 4214 proven. 526 refuted. 0 times theorem prover too weak. 6371 trivial. 0 not checked. [2021-05-02 13:33:48,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552989702] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:48,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:48,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-05-02 13:33:48,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220627650] [2021-05-02 13:33:48,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 13:33:48,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:48,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 13:33:48,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-05-02 13:33:48,645 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (3), 2 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 13:33:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:48,796 INFO L93 Difference]: Finished difference Result 583 states and 634 transitions. [2021-05-02 13:33:48,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 13:33:48,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (3), 2 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 267 [2021-05-02 13:33:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:48,798 INFO L225 Difference]: With dead ends: 583 [2021-05-02 13:33:48,798 INFO L226 Difference]: Without dead ends: 384 [2021-05-02 13:33:48,798 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 103.4ms TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-05-02 13:33:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-05-02 13:33:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 328. [2021-05-02 13:33:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 324 states have (on average 1.0833333333333333) internal successors, (351), 324 states have internal predecessors, (351), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 354 transitions. [2021-05-02 13:33:48,821 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 354 transitions. Word has length 267 [2021-05-02 13:33:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:48,822 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 354 transitions. [2021-05-02 13:33:48,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (3), 2 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 13:33:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 354 transitions. [2021-05-02 13:33:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2021-05-02 13:33:48,824 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:48,824 INFO L523 BasicCegarLoop]: trace histogram [120, 120, 20, 20, 20, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:49,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:49,041 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:49,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1570784715, now seen corresponding path program 10 times [2021-05-02 13:33:49,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:49,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152677733] [2021-05-02 13:33:49,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:49,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17361 backedges. 6565 proven. 875 refuted. 0 times theorem prover too weak. 9921 trivial. 0 not checked. [2021-05-02 13:33:49,144 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:49,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152677733] [2021-05-02 13:33:49,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152677733] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:49,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535415028] [2021-05-02 13:33:49,145 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:49,247 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 13:33:49,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:49,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 13:33:49,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:49,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:49,281 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:49,296 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:49,298 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:49,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:49,320 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:49,336 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:49,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:49,353 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:49,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17361 backedges. 6565 proven. 875 refuted. 0 times theorem prover too weak. 9921 trivial. 0 not checked. [2021-05-02 13:33:49,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535415028] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:49,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:49,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2021-05-02 13:33:49,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884881379] [2021-05-02 13:33:49,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 13:33:49,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:49,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 13:33:49,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-05-02 13:33:49,548 INFO L87 Difference]: Start difference. First operand 328 states and 354 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (3), 2 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 13:33:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:49,735 INFO L93 Difference]: Finished difference Result 632 states and 686 transitions. [2021-05-02 13:33:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 13:33:49,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (3), 2 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 327 [2021-05-02 13:33:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:49,737 INFO L225 Difference]: With dead ends: 632 [2021-05-02 13:33:49,737 INFO L226 Difference]: Without dead ends: 388 [2021-05-02 13:33:49,738 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 134.8ms TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2021-05-02 13:33:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-05-02 13:33:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2021-05-02 13:33:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 384 states have (on average 1.0807291666666667) internal successors, (415), 384 states have internal predecessors, (415), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 418 transitions. [2021-05-02 13:33:49,762 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 418 transitions. Word has length 327 [2021-05-02 13:33:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:49,763 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 418 transitions. [2021-05-02 13:33:49,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (3), 2 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 13:33:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 418 transitions. [2021-05-02 13:33:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2021-05-02 13:33:49,765 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:49,766 INFO L523 BasicCegarLoop]: trace histogram [144, 144, 24, 24, 24, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:49,981 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-05-02 13:33:49,982 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash 340883467, now seen corresponding path program 11 times [2021-05-02 13:33:49,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:49,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454751327] [2021-05-02 13:33:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:50,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 25003 backedges. 12595 proven. 3149 refuted. 0 times theorem prover too weak. 9259 trivial. 0 not checked. [2021-05-02 13:33:50,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:50,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454751327] [2021-05-02 13:33:50,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454751327] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:50,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922070393] [2021-05-02 13:33:50,071 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:50,240 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 130 check-sat command(s) [2021-05-02 13:33:50,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:50,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-02 13:33:50,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:50,370 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:50,372 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:50,462 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:50,463 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 25003 backedges. 12595 proven. 3149 refuted. 0 times theorem prover too weak. 9259 trivial. 0 not checked. [2021-05-02 13:33:50,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922070393] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:50,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:50,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-05-02 13:33:50,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516407502] [2021-05-02 13:33:50,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 13:33:50,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:50,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 13:33:50,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 13:33:50,609 INFO L87 Difference]: Start difference. First operand 388 states and 418 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (3), 2 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 13:33:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:50,746 INFO L93 Difference]: Finished difference Result 952 states and 1027 transitions. [2021-05-02 13:33:50,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 13:33:50,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (3), 2 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 387 [2021-05-02 13:33:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:50,748 INFO L225 Difference]: With dead ends: 952 [2021-05-02 13:33:50,748 INFO L226 Difference]: Without dead ends: 758 [2021-05-02 13:33:50,749 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 68.2ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-05-02 13:33:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2021-05-02 13:33:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 574. [2021-05-02 13:33:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 570 states have (on average 1.0789473684210527) internal successors, (615), 570 states have internal predecessors, (615), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 618 transitions. [2021-05-02 13:33:50,807 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 618 transitions. Word has length 387 [2021-05-02 13:33:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:50,807 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 618 transitions. [2021-05-02 13:33:50,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (3), 2 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 13:33:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 618 transitions. [2021-05-02 13:33:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2021-05-02 13:33:50,814 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:50,815 INFO L523 BasicCegarLoop]: trace histogram [216, 216, 36, 36, 36, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:51,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-05-02 13:33:51,022 INFO L428 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:51,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash -516898317, now seen corresponding path program 12 times [2021-05-02 13:33:51,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:51,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353966711] [2021-05-02 13:33:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:51,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 56384 backedges. 28332 proven. 9444 refuted. 0 times theorem prover too weak. 18608 trivial. 0 not checked. [2021-05-02 13:33:51,155 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:51,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353966711] [2021-05-02 13:33:51,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353966711] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:51,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955592403] [2021-05-02 13:33:51,155 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:51,426 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 134 check-sat command(s) [2021-05-02 13:33:51,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:51,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-02 13:33:51,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:51,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:51,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:52,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:52,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 56384 backedges. 0 proven. 28334 refuted. 0 times theorem prover too weak. 28050 trivial. 0 not checked. [2021-05-02 13:33:52,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955592403] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:52,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:52,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2021-05-02 13:33:52,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175163044] [2021-05-02 13:33:52,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 13:33:52,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:52,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 13:33:52,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-05-02 13:33:52,020 INFO L87 Difference]: Start difference. First operand 574 states and 618 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (3), 2 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 13:33:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:52,630 INFO L93 Difference]: Finished difference Result 2164 states and 2335 transitions. [2021-05-02 13:33:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 13:33:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (3), 2 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 573 [2021-05-02 13:33:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:52,635 INFO L225 Difference]: With dead ends: 2164 [2021-05-02 13:33:52,635 INFO L226 Difference]: Without dead ends: 1877 [2021-05-02 13:33:52,636 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 380.5ms TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2021-05-02 13:33:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2021-05-02 13:33:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1135. [2021-05-02 13:33:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1131 states have (on average 1.0778072502210434) internal successors, (1219), 1131 states have internal predecessors, (1219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1222 transitions. [2021-05-02 13:33:52,722 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1222 transitions. Word has length 573 [2021-05-02 13:33:52,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:52,722 INFO L480 AbstractCegarLoop]: Abstraction has 1135 states and 1222 transitions. [2021-05-02 13:33:52,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (3), 2 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 13:33:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1222 transitions. [2021-05-02 13:33:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1135 [2021-05-02 13:33:52,731 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:52,731 INFO L523 BasicCegarLoop]: trace histogram [432, 432, 72, 72, 72, 12, 12, 12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:52,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-05-02 13:33:52,932 INFO L428 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:52,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:52,932 INFO L82 PathProgramCache]: Analyzing trace with hash 716436802, now seen corresponding path program 13 times [2021-05-02 13:33:52,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:52,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077738357] [2021-05-02 13:33:52,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:53,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 226074 backedges. 100725 proven. 18886 refuted. 0 times theorem prover too weak. 106463 trivial. 0 not checked. [2021-05-02 13:33:53,243 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:53,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077738357] [2021-05-02 13:33:53,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077738357] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:53,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767017021] [2021-05-02 13:33:53,244 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:53,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 1902 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-02 13:33:53,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:53,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:53,600 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:53,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:53,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:53,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:53,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:53,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:53,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 226074 backedges. 100725 proven. 18886 refuted. 0 times theorem prover too weak. 106463 trivial. 0 not checked. [2021-05-02 13:33:54,462 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767017021] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:54,462 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:54,462 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-05-02 13:33:54,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392728760] [2021-05-02 13:33:54,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 13:33:54,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:54,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 13:33:54,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-05-02 13:33:54,463 INFO L87 Difference]: Start difference. First operand 1135 states and 1222 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (3), 2 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 13:33:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:54,755 INFO L93 Difference]: Finished difference Result 2445 states and 2635 transitions. [2021-05-02 13:33:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 13:33:54,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (3), 2 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 1134 [2021-05-02 13:33:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:54,759 INFO L225 Difference]: With dead ends: 2445 [2021-05-02 13:33:54,759 INFO L226 Difference]: Without dead ends: 1690 [2021-05-02 13:33:54,761 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1147 GetRequests, 1135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 111.3ms TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-05-02 13:33:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2021-05-02 13:33:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1414. [2021-05-02 13:33:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1410 states have (on average 1.0773049645390071) internal successors, (1519), 1410 states have internal predecessors, (1519), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1522 transitions. [2021-05-02 13:33:54,867 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1522 transitions. Word has length 1134 [2021-05-02 13:33:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:54,867 INFO L480 AbstractCegarLoop]: Abstraction has 1414 states and 1522 transitions. [2021-05-02 13:33:54,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (3), 2 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 13:33:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1522 transitions. [2021-05-02 13:33:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1414 [2021-05-02 13:33:54,880 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:54,881 INFO L523 BasicCegarLoop]: trace histogram [540, 540, 90, 90, 90, 15, 15, 15, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:55,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-05-02 13:33:55,097 INFO L428 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash 340066999, now seen corresponding path program 14 times [2021-05-02 13:33:55,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:55,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207554167] [2021-05-02 13:33:55,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:55,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 353397 backedges. 157375 proven. 31475 refuted. 0 times theorem prover too weak. 164547 trivial. 0 not checked. [2021-05-02 13:33:55,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:55,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207554167] [2021-05-02 13:33:55,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207554167] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:55,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575137390] [2021-05-02 13:33:55,534 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:55,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:33:55,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:55,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 2352 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 13:33:55,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:33:55,997 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:55,998 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:56,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:56,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:56,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:56,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:56,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:56,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:56,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:56,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:33:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 353397 backedges. 157375 proven. 31475 refuted. 0 times theorem prover too weak. 164547 trivial. 0 not checked. [2021-05-02 13:33:57,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575137390] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:57,075 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:33:57,075 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2021-05-02 13:33:57,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081484661] [2021-05-02 13:33:57,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 13:33:57,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:33:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 13:33:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-05-02 13:33:57,077 INFO L87 Difference]: Start difference. First operand 1414 states and 1522 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (3), 2 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 13:33:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:33:57,400 INFO L93 Difference]: Finished difference Result 2634 states and 2838 transitions. [2021-05-02 13:33:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 13:33:57,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (3), 2 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 1413 [2021-05-02 13:33:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:33:57,405 INFO L225 Difference]: With dead ends: 2634 [2021-05-02 13:33:57,405 INFO L226 Difference]: Without dead ends: 1693 [2021-05-02 13:33:57,407 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1428 GetRequests, 1414 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 141.4ms TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2021-05-02 13:33:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2021-05-02 13:33:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1693. [2021-05-02 13:33:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1689 states have (on average 1.0769686204854945) internal successors, (1819), 1689 states have internal predecessors, (1819), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 13:33:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 1822 transitions. [2021-05-02 13:33:57,557 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 1822 transitions. Word has length 1413 [2021-05-02 13:33:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:33:57,558 INFO L480 AbstractCegarLoop]: Abstraction has 1693 states and 1822 transitions. [2021-05-02 13:33:57,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (3), 2 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 13:33:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1822 transitions. [2021-05-02 13:33:57,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1693 [2021-05-02 13:33:57,576 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:33:57,576 INFO L523 BasicCegarLoop]: trace histogram [648, 648, 108, 108, 108, 18, 18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:33:57,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:57,789 INFO L428 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:33:57,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:33:57,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1541796446, now seen corresponding path program 15 times [2021-05-02 13:33:57,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:33:57,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254060619] [2021-05-02 13:33:57,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:33:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:58,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:33:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:33:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 509043 backedges. 0 proven. 339924 refuted. 0 times theorem prover too weak. 169119 trivial. 0 not checked. [2021-05-02 13:33:58,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:33:58,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254060619] [2021-05-02 13:33:58,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254060619] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:33:58,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697013603] [2021-05-02 13:33:58,472 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:33:58,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 189 check-sat command(s) [2021-05-02 13:33:58,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:33:58,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 35 conjunts are in the unsatisfiable core [2021-05-02 13:33:58,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:34:00,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:34:00,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:34:00,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:34:00,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:34:00,927 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:34:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 509043 backedges. 242351 proven. 1347 refuted. 0 times theorem prover too weak. 265345 trivial. 0 not checked. [2021-05-02 13:34:00,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697013603] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:34:00,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:34:00,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21] total 26 [2021-05-02 13:34:00,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391776144] [2021-05-02 13:34:00,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 13:34:00,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:34:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 13:34:00,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2021-05-02 13:34:00,952 INFO L87 Difference]: Start difference. First operand 1693 states and 1822 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 25 states have internal predecessors, (108), 1 states have call successors, (3), 2 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 13:34:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:34:05,079 INFO L93 Difference]: Finished difference Result 4422 states and 4764 transitions. [2021-05-02 13:34:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-05-02 13:34:05,079 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 25 states have internal predecessors, (108), 1 states have call successors, (3), 2 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 1692 [2021-05-02 13:34:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:34:05,081 INFO L225 Difference]: With dead ends: 4422 [2021-05-02 13:34:05,081 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 13:34:05,087 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1781 GetRequests, 1675 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3939 ImplicationChecksByTransitivity, 3565.9ms TimeCoverageRelationStatistics Valid=1006, Invalid=10550, Unknown=0, NotChecked=0, Total=11556 [2021-05-02 13:34:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 13:34:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 13:34:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 13:34:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 13:34:05,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1692 [2021-05-02 13:34:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:34:05,088 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 13:34:05,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 25 states have internal predecessors, (108), 1 states have call successors, (3), 2 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 13:34:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 13:34:05,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 13:34:05,305 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:34:05,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 13:34:32,359 WARN L205 SmtUtils]: Spent 27.03 s on a formula simplification. DAG size of input: 3173 DAG size of output: 932 [2021-05-02 13:34:33,631 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 565 DAG size of output: 352 [2021-05-02 13:34:43,644 WARN L205 SmtUtils]: Spent 10.00 s on a formula simplification. DAG size of input: 837 DAG size of output: 39 [2021-05-02 13:34:45,341 WARN L205 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 286 DAG size of output: 29 [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 13:34:45,344 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point L31-1(lines 31 33) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 15 35) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point L23-2(lines 23 29) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L194 CegarLoopUtils]: At program point L23-3(lines 23 29) the Hoare annotation is: (and (= main_~d~0 6) (= main_~c~0 6) (< main_~b~0 7) (< main_~a~0 6)) [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point L32(line 32) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L198 CegarLoopUtils]: For program point L24-2(lines 24 28) no Hoare annotation was computed. [2021-05-02 13:34:45,344 INFO L194 CegarLoopUtils]: At program point L24-3(lines 24 28) the Hoare annotation is: (let ((.cse0 (< main_~a~0 6)) (.cse1 (<= main_~b~0 5))) (or (and .cse0 .cse1 (= main_~c~0 3)) (and (= main_~c~0 0) .cse0 .cse1) (and (= main_~c~0 4) .cse0 .cse1) (and .cse0 .cse1 (= main_~c~0 2)) (and (= main_~c~0 1) .cse0 .cse1) (and (= main_~d~0 6) (= main_~c~0 6) .cse0 .cse1) (and (= 5 main_~c~0) .cse0 .cse1))) [2021-05-02 13:34:45,345 INFO L198 CegarLoopUtils]: For program point L25-2(lines 25 27) no Hoare annotation was computed. [2021-05-02 13:34:45,345 INFO L194 CegarLoopUtils]: At program point L25-3(lines 25 27) the Hoare annotation is: (let ((.cse0 (= 5 main_~c~0)) (.cse1 (< main_~a~0 6)) (.cse2 (<= main_~b~0 5))) (or (and .cse0 .cse1 .cse2 (= main_~d~0 3)) (and (= main_~d~0 1) .cse0 .cse1 .cse2) (and .cse1 .cse2 (= main_~c~0 3)) (and (= main_~c~0 0) .cse1 .cse2) (and (= main_~d~0 2) .cse0 .cse1 .cse2) (and (= main_~c~0 4) .cse1 .cse2) (and .cse1 .cse2 (= main_~c~0 2)) (and (= main_~d~0 4) .cse0 .cse1 .cse2) (and (= main_~c~0 1) .cse1 .cse2) (and (= main_~d~0 6) .cse0 .cse1 .cse2) (and (= main_~d~0 0) .cse0 .cse1 .cse2) (and (= 5 main_~d~0) .cse0 .cse1 .cse2))) [2021-05-02 13:34:45,345 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 15 35) no Hoare annotation was computed. [2021-05-02 13:34:45,345 INFO L198 CegarLoopUtils]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 32) no Hoare annotation was computed. [2021-05-02 13:34:45,345 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 15 35) the Hoare annotation is: true [2021-05-02 13:34:45,345 INFO L198 CegarLoopUtils]: For program point L22-2(lines 22 30) no Hoare annotation was computed. [2021-05-02 13:34:45,345 INFO L194 CegarLoopUtils]: At program point L22-3(lines 22 30) the Hoare annotation is: (and (= main_~d~0 6) (< main_~a~0 7) (= main_~c~0 6) (< main_~b~0 7) (<= 6 main_~b~0)) [2021-05-02 13:34:45,345 INFO L198 CegarLoopUtils]: For program point L22-4(lines 15 35) no Hoare annotation was computed. [2021-05-02 13:34:45,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 01:34:45 BoogieIcfgContainer [2021-05-02 13:34:45,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 13:34:45,356 INFO L168 Benchmark]: Toolchain (without parser) took 63931.99 ms. Allocated memory was 224.4 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 188.9 MB in the beginning and 1.1 GB in the end (delta: -866.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. [2021-05-02 13:34:45,357 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 224.4 MB. Free memory is still 205.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 13:34:45,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.70 ms. Allocated memory is still 224.4 MB. Free memory was 188.6 MB in the beginning and 207.2 MB in the end (delta: -18.7 MB). Peak memory consumption was 10.0 MB. Max. memory is 8.0 GB. [2021-05-02 13:34:45,357 INFO L168 Benchmark]: Boogie Preprocessor took 34.47 ms. Allocated memory is still 224.4 MB. Free memory was 207.2 MB in the beginning and 205.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 13:34:45,357 INFO L168 Benchmark]: RCFGBuilder took 280.31 ms. Allocated memory is still 224.4 MB. Free memory was 205.7 MB in the beginning and 191.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-05-02 13:34:45,357 INFO L168 Benchmark]: TraceAbstraction took 63435.23 ms. Allocated memory was 224.4 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 191.0 MB in the beginning and 1.1 GB in the end (delta: -864.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. [2021-05-02 13:34:45,357 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 224.4 MB. Free memory is still 205.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 177.70 ms. Allocated memory is still 224.4 MB. Free memory was 188.6 MB in the beginning and 207.2 MB in the end (delta: -18.7 MB). Peak memory consumption was 10.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.47 ms. Allocated memory is still 224.4 MB. Free memory was 207.2 MB in the beginning and 205.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 280.31 ms. Allocated memory is still 224.4 MB. Free memory was 205.7 MB in the beginning and 191.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 63435.23 ms. Allocated memory was 224.4 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 191.0 MB in the beginning and 1.1 GB in the end (delta: -864.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23346.7ms, OverallIterations: 20, TraceHistogramMax: 648, EmptinessCheckTime: 69.5ms, AutomataDifference: 7596.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 40037.7ms, InitialAbstractionConstructionTime: 15.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 344 SDtfs, 1582 SDslu, 301 SDs, 0 SdLazy, 1989 SolverSat, 389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1208.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6877 GetRequests, 6581 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4420 ImplicationChecksByTransitivity, 5779.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1693occurred in iteration=19, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 600.7ms AutomataMinimizationTime, 20 MinimizatonAttempts, 1518 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 1519 NumberOfFragments, 279 HoareAnnotationTreeSize, 8 FomulaSimplifications, 122422001 FormulaSimplificationTreeSizeReduction, 28321.8ms HoareSimplificationTime, 8 FomulaSimplificationsInter, 141027 FormulaSimplificationTreeSizeReductionInter, 11699.2ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 535.2ms SsaConstructionTime, 2256.9ms SatisfiabilityAnalysisTime, 8545.6ms InterpolantComputationTime, 13197 NumberOfCodeBlocks, 11739 NumberOfCodeBlocksAsserted, 554 NumberOfCheckSat, 13162 ConstructedInterpolants, 0 QuantifiedInterpolants, 25896 SizeOfPredicates, 4 NumberOfNonLiveVariables, 9147 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 1933892/2423578 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((((((5 == c && a < 6) && b <= 5) && d == 3) || (((d == 1 && 5 == c) && a < 6) && b <= 5)) || ((a < 6 && b <= 5) && c == 3)) || ((c == 0 && a < 6) && b <= 5)) || (((d == 2 && 5 == c) && a < 6) && b <= 5)) || ((c == 4 && a < 6) && b <= 5)) || ((a < 6 && b <= 5) && c == 2)) || (((d == 4 && 5 == c) && a < 6) && b <= 5)) || ((c == 1 && a < 6) && b <= 5)) || (((d == 6 && 5 == c) && a < 6) && b <= 5)) || (((d == 0 && 5 == c) && a < 6) && b <= 5)) || (((5 == d && 5 == c) && a < 6) && b <= 5) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((d == 6 && a < 7) && c == 6) && b < 7) && 6 <= b - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((d == 6 && c == 6) && b < 7) && a < 6 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((a < 6 && b <= 5) && c == 3) || ((c == 0 && a < 6) && b <= 5)) || ((c == 4 && a < 6) && b <= 5)) || ((a < 6 && b <= 5) && c == 2)) || ((c == 1 && a < 6) && b <= 5)) || (((d == 6 && c == 6) && a < 6) && b <= 5)) || ((5 == c && a < 6) && b <= 5) RESULT: Ultimate proved your program to be correct! Received shutdown request...