java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/mapsum5.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 12:06:33,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 12:06:33,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 12:06:33,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 12:06:33,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 12:06:33,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 12:06:33,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 12:06:33,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 12:06:33,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 12:06:33,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 12:06:33,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 12:06:33,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 12:06:33,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 12:06:33,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 12:06:33,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 12:06:33,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 12:06:33,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 12:06:33,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 12:06:33,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 12:06:33,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 12:06:33,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 12:06:33,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 12:06:33,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 12:06:33,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 12:06:33,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 12:06:33,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 12:06:33,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 12:06:33,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 12:06:33,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 12:06:33,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 12:06:33,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 12:06:33,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 12:06:33,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 12:06:33,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 12:06:34,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 12:06:34,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 12:06:34,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 12:06:34,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 12:06:34,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 12:06:34,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 12:06:34,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 12:06:34,003 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 [2019-09-07 12:06:34,017 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 12:06:34,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 12:06:34,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 12:06:34,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 12:06:34,019 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 12:06:34,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 12:06:34,020 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 12:06:34,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 12:06:34,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 12:06:34,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 12:06:34,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 12:06:34,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 12:06:34,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 12:06:34,021 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 12:06:34,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 12:06:34,021 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 12:06:34,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 12:06:34,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 12:06:34,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 12:06:34,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 12:06:34,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 12:06:34,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 12:06:34,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 12:06:34,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 12:06:34,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 12:06:34,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 12:06:34,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 12:06:34,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 12:06:34,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 12:06:34,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 12:06:34,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 12:06:34,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 12:06:34,067 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 12:06:34,068 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 12:06:34,068 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum5.i [2019-09-07 12:06:34,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec78621d/75ba0ac2ad674709ac98e700199b9a8b/FLAG73da0ecc9 [2019-09-07 12:06:34,529 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 12:06:34,532 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum5.i [2019-09-07 12:06:34,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec78621d/75ba0ac2ad674709ac98e700199b9a8b/FLAG73da0ecc9 [2019-09-07 12:06:34,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec78621d/75ba0ac2ad674709ac98e700199b9a8b [2019-09-07 12:06:34,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 12:06:34,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 12:06:34,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 12:06:34,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 12:06:34,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 12:06:34,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:06:34" (1/1) ... [2019-09-07 12:06:34,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f71350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:34, skipping insertion in model container [2019-09-07 12:06:34,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:06:34" (1/1) ... [2019-09-07 12:06:34,994 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 12:06:35,015 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 12:06:35,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:06:35,278 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 12:06:35,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:06:35,426 INFO L192 MainTranslator]: Completed translation [2019-09-07 12:06:35,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:35 WrapperNode [2019-09-07 12:06:35,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 12:06:35,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 12:06:35,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 12:06:35,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 12:06:35,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:35" (1/1) ... [2019-09-07 12:06:35,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:35" (1/1) ... [2019-09-07 12:06:35,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:35" (1/1) ... [2019-09-07 12:06:35,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:35" (1/1) ... [2019-09-07 12:06:35,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:35" (1/1) ... [2019-09-07 12:06:35,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:35" (1/1) ... [2019-09-07 12:06:35,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:35" (1/1) ... [2019-09-07 12:06:35,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 12:06:35,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 12:06:35,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 12:06:35,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 12:06:35,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:35" (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 [2019-09-07 12:06:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 12:06:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 12:06:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2019-09-07 12:06:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 12:06:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 12:06:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 12:06:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2019-09-07 12:06:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 12:06:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 12:06:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 12:06:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 12:06:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 12:06:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 12:06:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 12:06:35,876 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 12:06:35,877 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 12:06:35,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:06:35 BoogieIcfgContainer [2019-09-07 12:06:35,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 12:06:35,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 12:06:35,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 12:06:35,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 12:06:35,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 12:06:34" (1/3) ... [2019-09-07 12:06:35,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca0ab19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:06:35, skipping insertion in model container [2019-09-07 12:06:35,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:06:35" (2/3) ... [2019-09-07 12:06:35,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca0ab19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:06:35, skipping insertion in model container [2019-09-07 12:06:35,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:06:35" (3/3) ... [2019-09-07 12:06:35,886 INFO L109 eAbstractionObserver]: Analyzing ICFG mapsum5.i [2019-09-07 12:06:35,895 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 12:06:35,902 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 12:06:35,918 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 12:06:35,943 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 12:06:35,944 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 12:06:35,944 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 12:06:35,944 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 12:06:35,944 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 12:06:35,944 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 12:06:35,944 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 12:06:35,944 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 12:06:35,945 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 12:06:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-07 12:06:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 12:06:35,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:06:35,965 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:06:35,967 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:06:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:06:35,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1089041636, now seen corresponding path program 1 times [2019-09-07 12:06:35,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:06:35,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:06:36,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:36,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:06:36,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:06:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 12:06:36,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:06:36,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 12:06:36,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 12:06:36,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 12:06:36,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 12:06:36,148 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-09-07 12:06:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:06:36,169 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2019-09-07 12:06:36,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 12:06:36,170 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2019-09-07 12:06:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:06:36,182 INFO L225 Difference]: With dead ends: 57 [2019-09-07 12:06:36,184 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 12:06:36,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 12:06:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 12:06:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-07 12:06:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 12:06:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-07 12:06:36,229 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2019-09-07 12:06:36,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:06:36,229 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-07 12:06:36,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 12:06:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-07 12:06:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 12:06:36,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:06:36,232 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:06:36,233 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:06:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:06:36,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1200270940, now seen corresponding path program 1 times [2019-09-07 12:06:36,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:06:36,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:06:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:36,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:06:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:06:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 12:06:36,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:06:36,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:06:36,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:06:36,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:06:36,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:06:36,364 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-09-07 12:06:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:06:36,432 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-09-07 12:06:36,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:06:36,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-07 12:06:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:06:36,434 INFO L225 Difference]: With dead ends: 47 [2019-09-07 12:06:36,434 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 12:06:36,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:06:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 12:06:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-07 12:06:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 12:06:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-07 12:06:36,444 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 33 [2019-09-07 12:06:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:06:36,444 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-07 12:06:36,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:06:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-07 12:06:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 12:06:36,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:06:36,446 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:06:36,446 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:06:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:06:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash 592534566, now seen corresponding path program 1 times [2019-09-07 12:06:36,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:06:36,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:06:36,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:36,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:06:36,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:06:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 12:06:36,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:06:36,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:06:36,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:06:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:06:36,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 12:06:36,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:06:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 12:06:36,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:06:36,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-09-07 12:06:36,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 12:06:36,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 12:06:36,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:06:36,708 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-09-07 12:06:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:06:36,839 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-09-07 12:06:36,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 12:06:36,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-09-07 12:06:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:06:36,842 INFO L225 Difference]: With dead ends: 51 [2019-09-07 12:06:36,843 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 12:06:36,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 12:06:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 12:06:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-09-07 12:06:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 12:06:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-07 12:06:36,857 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 35 [2019-09-07 12:06:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:06:36,858 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-07 12:06:36,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 12:06:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-07 12:06:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 12:06:36,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:06:36,862 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:06:36,863 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:06:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:06:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash 476203942, now seen corresponding path program 1 times [2019-09-07 12:06:36,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:06:36,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:06:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:36,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:06:36,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:06:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 12:06:36,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:06:36,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 12:06:36,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:06:36,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:06:37,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:06:37,000 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-09-07 12:06:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:06:37,063 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-09-07 12:06:37,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:06:37,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-09-07 12:06:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:06:37,066 INFO L225 Difference]: With dead ends: 46 [2019-09-07 12:06:37,066 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 12:06:37,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:06:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 12:06:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-07 12:06:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 12:06:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-07 12:06:37,088 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 43 [2019-09-07 12:06:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:06:37,090 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-07 12:06:37,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:06:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-07 12:06:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 12:06:37,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:06:37,092 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:06:37,092 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:06:37,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:06:37,093 INFO L82 PathProgramCache]: Analyzing trace with hash -106794812, now seen corresponding path program 1 times [2019-09-07 12:06:37,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:06:37,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:06:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:37,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:06:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:06:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:06:37,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:06:37,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:06:37,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:06:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:06:37,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 12:06:37,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:06:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 12:06:37,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:06:37,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-07 12:06:37,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 12:06:37,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 12:06:37,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 12:06:37,285 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2019-09-07 12:06:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:06:37,377 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-09-07 12:06:37,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:06:37,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-09-07 12:06:37,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:06:37,379 INFO L225 Difference]: With dead ends: 54 [2019-09-07 12:06:37,379 INFO L226 Difference]: Without dead ends: 35 [2019-09-07 12:06:37,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:06:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-07 12:06:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-07 12:06:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-07 12:06:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-07 12:06:37,388 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 45 [2019-09-07 12:06:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:06:37,388 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-07 12:06:37,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 12:06:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-07 12:06:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 12:06:37,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:06:37,390 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:06:37,390 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:06:37,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:06:37,391 INFO L82 PathProgramCache]: Analyzing trace with hash 986441794, now seen corresponding path program 2 times [2019-09-07 12:06:37,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:06:37,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:06:37,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:37,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:06:37,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:06:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:06:40,764 WARN L188 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-07 12:06:45,694 WARN L188 SmtUtils]: Spent 4.87 s on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-07 12:06:48,053 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2019-09-07 12:06:50,332 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 80 DAG size of output: 36 [2019-09-07 12:07:00,495 WARN L188 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2019-09-07 12:07:00,869 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-07 12:07:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 12:07:00,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:00,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:00,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:07:01,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:07:01,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:01,087 WARN L254 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-07 12:07:01,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:01,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 12:07:01,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 12:07:01,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:07:01,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 12:07:01,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-07 12:07:01,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:07:01,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:07:01,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 41 [2019-09-07 12:07:01,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 12:07:01,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:07:01,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 43 [2019-09-07 12:07:01,653 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 12:07:01,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:07:01,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-07 12:07:01,690 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:145, output treesize:93 [2019-09-07 12:07:01,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:07:02,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:07:02,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 61 [2019-09-07 12:07:02,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 12:07:02,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:07:02,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 59 [2019-09-07 12:07:02,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 12:07:04,142 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-07 12:07:04,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:07:04,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-07 12:07:04,143 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:211, output treesize:149 [2019-09-07 12:07:04,562 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-07 12:07:04,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:07:04,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:07:04,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2019-09-07 12:07:04,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 12:07:04,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:07:04,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:07:04,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 56 [2019-09-07 12:07:04,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 12:07:04,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:07:04,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-07 12:07:04,760 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:165, output treesize:153 [2019-09-07 12:07:05,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:07:05,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:07:05,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:07:05,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:07:05,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:07:05,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 50 [2019-09-07 12:07:05,251 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-07 12:07:05,257 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:07:05,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 44 [2019-09-07 12:07:05,259 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-07 12:07:09,418 WARN L188 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-07 12:07:09,418 INFO L567 ElimStorePlain]: treesize reduction 148, result has 45.8 percent of original size [2019-09-07 12:07:09,423 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:07:09,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 40 [2019-09-07 12:07:09,425 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-07 12:07:09,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:07:09,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-09-07 12:07:09,492 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:361, output treesize:85 [2019-09-07 12:07:12,227 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-09-07 12:07:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:07:12,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:12,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 42 [2019-09-07 12:07:12,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 12:07:12,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 12:07:12,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1568, Unknown=3, NotChecked=0, Total=1722 [2019-09-07 12:07:12,259 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 42 states. [2019-09-07 12:07:18,555 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-07 12:07:19,839 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-09-07 12:07:22,523 WARN L188 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-09-07 12:07:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:22,664 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2019-09-07 12:07:22,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 12:07:22,667 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 51 [2019-09-07 12:07:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:22,671 INFO L225 Difference]: With dead ends: 88 [2019-09-07 12:07:22,672 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 12:07:22,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=281, Invalid=2578, Unknown=3, NotChecked=0, Total=2862 [2019-09-07 12:07:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 12:07:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-09-07 12:07:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 12:07:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2019-09-07 12:07:22,690 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 51 [2019-09-07 12:07:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:22,691 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-09-07 12:07:22,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 12:07:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2019-09-07 12:07:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 12:07:22,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:22,693 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:22,693 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1056904772, now seen corresponding path program 3 times [2019-09-07 12:07:22,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:22,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:22,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:22,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:22,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 12:07:22,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:22,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:22,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:07:22,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 12:07:22,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:22,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 12:07:22,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 38 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:07:22,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:22,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-09-07 12:07:22,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:07:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:07:22,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:07:22,924 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 13 states. [2019-09-07 12:07:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:23,315 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2019-09-07 12:07:23,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 12:07:23,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-07 12:07:23,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:23,318 INFO L225 Difference]: With dead ends: 120 [2019-09-07 12:07:23,318 INFO L226 Difference]: Without dead ends: 99 [2019-09-07 12:07:23,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-09-07 12:07:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-07 12:07:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-09-07 12:07:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 12:07:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2019-09-07 12:07:23,333 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 53 [2019-09-07 12:07:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:23,333 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2019-09-07 12:07:23,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:07:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2019-09-07 12:07:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 12:07:23,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:23,336 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:23,336 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:23,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:23,336 INFO L82 PathProgramCache]: Analyzing trace with hash -213267264, now seen corresponding path program 4 times [2019-09-07 12:07:23,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:23,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:23,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:23,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:23,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 12:07:23,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:23,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:07:23,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:23,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:07:23,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:23,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 12:07:23,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 12:07:23,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:23,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-09-07 12:07:23,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:07:23,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:07:23,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:07:23,531 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 14 states. [2019-09-07 12:07:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:23,780 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2019-09-07 12:07:23,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 12:07:23,780 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-09-07 12:07:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:23,782 INFO L225 Difference]: With dead ends: 114 [2019-09-07 12:07:23,782 INFO L226 Difference]: Without dead ends: 47 [2019-09-07 12:07:23,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-09-07 12:07:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-07 12:07:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2019-09-07 12:07:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 12:07:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-07 12:07:23,789 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 53 [2019-09-07 12:07:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:23,789 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-07 12:07:23,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:07:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-07 12:07:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 12:07:23,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:23,791 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:23,791 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:23,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1973054432, now seen corresponding path program 5 times [2019-09-07 12:07:23,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:23,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:23,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:23,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:23,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:29,755 WARN L188 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-09-07 12:07:34,433 WARN L188 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 127 DAG size of output: 52 [2019-09-07 12:07:36,153 WARN L188 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 123 DAG size of output: 52 [2019-09-07 12:07:38,942 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-07 12:08:12,512 WARN L188 SmtUtils]: Spent 17.20 s on a formula simplification. DAG size of input: 128 DAG size of output: 59 [2019-09-07 12:08:32,485 WARN L188 SmtUtils]: Spent 9.85 s on a formula simplification. DAG size of input: 137 DAG size of output: 63 [2019-09-07 12:08:34,560 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse26 (= |c_main_~#x~0.offset| 0))) (and (let ((.cse23 (<= 1 |c_main_~#x~0.offset|)) (.cse7 (<= (+ |c_main_~#x~0.offset| 1) 0))) (or (let ((.cse0 (<= 3 c_~N~0))) (and .cse0 (let ((.cse2 (* 4 c_main_~i~2))) (let ((.cse3 (* 4 c_~N~0)) (.cse1 (+ .cse2 |c_main_~#x~0.offset|)) (.cse4 (< 3 c_~N~0))) (or (<= 8 .cse1) (<= (+ .cse2 |c_main_~#x~0.offset| 13) .cse3) (and (or (<= 2 c_main_~i~2) (let ((.cse25 (<= 12 .cse3))) (and .cse0 (let ((.cse24 (< 12 .cse3))) (or (and (or (and .cse0 (or .cse4 (and (let ((.cse13 (= (mod 0 4) 0))) (or (<= 4 |c_main_~#x~0.offset|) (let ((.cse5 (= 0 .cse1)) (.cse12 (<= 2 (div (+ .cse3 (- 4)) 4))) (.cse14 (not (= .cse3 (+ .cse2 4))))) (and .cse5 (let ((.cse22 (select |c_#memory_int| |c_main_~#x~0.base|))) (let ((.cse16 (select .cse22 .cse1)) (.cse17 (select .cse22 (+ .cse3 |c_main_~#x~0.offset| (- 4))))) (let ((.cse15 (= c_main_~ret~1 c_main_~ret2~0)) (.cse9 (+ .cse16 c_main_~temp~0 .cse17)) (.cse6 (not (= (+ .cse2 12) .cse3)))) (let ((.cse8 (and .cse5 (or (let ((.cse21 (* 3 c_~N~0))) (let ((.cse20 (* 4294967296 (div (+ .cse16 .cse21 c_main_~temp~0 .cse17 (- 6)) 4294967296)))) (let ((.cse18 (+ .cse20 9)) (.cse19 (+ (* 4294967296 (div (+ .cse16 .cse21 c_main_~temp~0 .cse17 (- 2147483654)) 4294967296)) .cse21))) (and (<= .cse18 .cse19) .cse0 .cse15 (<= .cse9 (+ (* 4294967296 (div (+ .cse16 c_main_~temp~0 .cse17 (- 2147483645)) 4294967296)) 4294967292)) (or (= (+ .cse20 c_main_~ret~1 4294967302) (+ .cse16 .cse21 c_main_~temp~0 .cse17)) (< .cse18 .cse19)))))) .cse6) .cse12 .cse13 .cse14))) (or .cse6 .cse7 .cse8 (let ((.cse11 (+ .cse16 c_main_~temp~0 .cse17 3))) (and (or .cse7 (and .cse5 (or .cse6 .cse7 (and (or (and .cse5 (let ((.cse10 (* 4294967296 (div .cse11 4294967296)))) (or .cse6 (<= .cse9 (+ (* 4294967296 (div (+ .cse10 (- 1)) 4294967296)) 2147483644)) (and (<= .cse9 (+ (* 4294967296 (div .cse10 4294967296)) 2147483644)) (= (+ .cse10 c_main_~ret~1) .cse11)) .cse7 .cse8)) .cse12 .cse13 .cse14) .cse7) .cse15) .cse8) .cse12 .cse13 .cse14)) (<= (* 4294967296 (div (+ .cse16 c_main_~temp~0 .cse17 2147483651) 4294967296)) .cse11)))))))) .cse12 .cse13 .cse14)) .cse23 (and (<= 2 (div (+ .cse3 (- 8)) 4)) .cse13) .cse7)) .cse0))) .cse24) .cse25) .cse24)) .cse26 .cse25))) (= 0 .cse2)) (<= 1 .cse1) .cse4))) (= c_main_~i~2 0))) .cse23 .cse7)) .cse26)) is different from false [2019-09-07 12:08:58,938 WARN L188 SmtUtils]: Spent 24.23 s on a formula simplification. DAG size of input: 117 DAG size of output: 67 [2019-09-07 12:09:12,458 WARN L188 SmtUtils]: Spent 11.16 s on a formula simplification. DAG size of input: 115 DAG size of output: 67 [2019-09-07 12:09:18,391 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-09-07 12:09:30,639 WARN L188 SmtUtils]: Spent 9.10 s on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-09-07 12:09:41,849 WARN L188 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2019-09-07 12:09:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 101 refuted. 0 times theorem prover too weak. 8 trivial. 1 not checked. [2019-09-07 12:09:45,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:09:45,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:09:45,680 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 12:09:45,890 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-07 12:09:45,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:09:45,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-07 12:09:45,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:09:45,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 12:09:45,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 12:09:45,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:09:45,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 12:09:45,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-09-07 12:09:53,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:09:53,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:53,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:53,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:53,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 60 [2019-09-07 12:09:53,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 12:09:53,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:53,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:53,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:53,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 58 [2019-09-07 12:09:53,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 12:09:54,031 INFO L567 ElimStorePlain]: treesize reduction 28, result has 78.9 percent of original size [2019-09-07 12:09:54,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-07 12:09:54,032 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:185, output treesize:105 [2019-09-07 12:09:57,018 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-07 12:09:59,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:09:59,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:09:59,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:09:59,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,277 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,287 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 82 [2019-09-07 12:09:59,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 12:09:59,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,299 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,308 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 81 [2019-09-07 12:09:59,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 12:09:59,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,321 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,332 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 88 [2019-09-07 12:09:59,336 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-07 12:09:59,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:09:59,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:09:59,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 80 [2019-09-07 12:09:59,351 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-07 12:09:59,513 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-07 12:09:59,514 INFO L567 ElimStorePlain]: treesize reduction 269, result has 42.0 percent of original size [2019-09-07 12:09:59,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-07 12:09:59,514 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:524, output treesize:195 [2019-09-07 12:10:00,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:10:00,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:00,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:00,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:00,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 71 [2019-09-07 12:10:00,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 12:10:00,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:10:00,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:00,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:00,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:00,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 61 [2019-09-07 12:10:00,182 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 12:10:00,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:10:00,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-07 12:10:00,232 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:195, output treesize:157 [2019-09-07 12:10:01,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:10:01,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:01,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:01,027 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:10:01,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:01,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2019-09-07 12:10:01,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 12:10:01,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:01,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:01,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:01,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:01,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:01,067 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:10:01,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 74 [2019-09-07 12:10:01,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 12:10:01,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:10:01,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-07 12:10:01,119 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:189, output treesize:172 [2019-09-07 12:10:07,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:10:07,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:10:07,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:10:07,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:07,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:07,313 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:10:07,315 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:10:07,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 63 [2019-09-07 12:10:07,317 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-07 12:10:07,408 INFO L567 ElimStorePlain]: treesize reduction 257, result has 34.4 percent of original size [2019-09-07 12:10:07,408 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-09-07 12:10:07,408 INFO L464 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2019-09-07 12:10:07,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:07,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:10:07,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:10:07,417 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:10:07,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 42 [2019-09-07 12:10:07,419 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-07 12:10:07,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:10:07,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-09-07 12:10:07,455 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:473, output treesize:75 [2019-09-07 12:10:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 108 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 12:10:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:10:11,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 37] total 74 [2019-09-07 12:10:11,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-07 12:10:11,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-07 12:10:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=4771, Unknown=20, NotChecked=142, Total=5402 [2019-09-07 12:10:11,845 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 74 states. [2019-09-07 12:10:12,048 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-09-07 12:10:21,871 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-07 12:10:23,228 WARN L188 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 48 [2019-09-07 12:10:23,737 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-07 12:10:24,453 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2019-09-07 12:10:24,831 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-07 12:10:49,545 WARN L188 SmtUtils]: Spent 22.25 s on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-07 12:10:50,768 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-07 12:10:53,014 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 c_~N~0))) (let ((.cse9 (= |c_main_~#x~0.offset| 0)) (.cse8 (+ .cse5 |c_main_~#x~0.offset| (- 4))) (.cse7 (select |c_#memory_int| |c_main_~#x~0.base|)) (.cse12 (<= 12 .cse5))) (and (let ((.cse6 (store .cse7 .cse8 c_main_~temp~0))) (let ((.cse1 (= c_main_~ret~1 c_main_~ret2~0)) (.cse2 (select .cse6 (+ .cse5 |c_main_~#x~0.offset| (- 8)))) (.cse3 (select .cse6 0))) (or (let ((.cse0 (+ .cse2 .cse3 c_main_~temp~0 3))) (and (= .cse0 (+ (* 4294967296 (div .cse0 4294967296)) c_main_~ret~1)) .cse1 (<= (* 4294967296 (div (+ .cse2 .cse3 c_main_~temp~0 2147483651) 4294967296)) .cse0))) (and (let ((.cse4 (* 3 c_~N~0))) (= (+ .cse2 .cse4 .cse3 c_main_~temp~0) (+ c_main_~ret~1 (* 4294967296 (div (+ .cse2 .cse4 .cse3 c_main_~temp~0 (- 6)) 4294967296)) 4294967302))) .cse1 (<= (+ .cse2 .cse3 c_main_~temp~0) (+ (* 4294967296 (div (+ .cse2 .cse3 c_main_~temp~0 (- 2147483645)) 4294967296)) 4294967292))) (< 12 .cse5)))) .cse9 (let ((.cse10 (mod (+ (select .cse7 |c_main_~#x~0.offset|) (select .cse7 .cse8) (select .cse7 (+ |c_main_~#x~0.offset| 4)) 3) 4294967296)) (.cse11 (<= c_~N~0 3))) (or (and (< 2147483647 .cse10) (= (+ c_main_~ret2~0 4294967296) .cse10) .cse11 .cse9 (= (+ c_main_~ret~1 4294967296) .cse10) .cse12) (and (= c_main_~ret~1 .cse10) (= c_main_~ret2~0 .cse10) (<= c_main_~ret~1 2147483647) .cse11 .cse9 .cse12))) .cse12 (<= 8 (* 4 c_main_~i~1))))) is different from false [2019-09-07 12:11:00,178 WARN L188 SmtUtils]: Spent 6.90 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-07 12:11:13,926 WARN L188 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-07 12:11:40,694 WARN L188 SmtUtils]: Spent 22.44 s on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-09-07 12:11:50,523 WARN L188 SmtUtils]: Spent 8.80 s on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-07 12:11:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:11:55,275 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2019-09-07 12:11:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 12:11:55,276 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 61 [2019-09-07 12:11:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:11:55,277 INFO L225 Difference]: With dead ends: 105 [2019-09-07 12:11:55,277 INFO L226 Difference]: Without dead ends: 77 [2019-09-07 12:11:55,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3312 ImplicationChecksByTransitivity, 253.9s TimeCoverageRelationStatistics Valid=773, Invalid=8522, Unknown=25, NotChecked=382, Total=9702 [2019-09-07 12:11:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-07 12:11:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2019-09-07 12:11:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 12:11:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2019-09-07 12:11:55,292 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 61 [2019-09-07 12:11:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:11:55,293 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2019-09-07 12:11:55,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-07 12:11:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2019-09-07 12:11:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 12:11:55,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:11:55,295 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:11:55,295 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:11:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:11:55,295 INFO L82 PathProgramCache]: Analyzing trace with hash 70872670, now seen corresponding path program 6 times [2019-09-07 12:11:55,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:11:55,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:11:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:55,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:11:55,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:11:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 91 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-07 12:11:55,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:11:55,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:11:55,423 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 12:11:55,502 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-07 12:11:55,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:11:55,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 12:11:55,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:11:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 49 proven. 66 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-07 12:11:55,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:11:55,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2019-09-07 12:11:55,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 12:11:55,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 12:11:55,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-09-07 12:11:55,635 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 17 states. [2019-09-07 12:11:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:11:56,023 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2019-09-07 12:11:56,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 12:11:56,023 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2019-09-07 12:11:56,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:11:56,025 INFO L225 Difference]: With dead ends: 167 [2019-09-07 12:11:56,026 INFO L226 Difference]: Without dead ends: 121 [2019-09-07 12:11:56,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2019-09-07 12:11:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-07 12:11:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2019-09-07 12:11:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-07 12:11:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-09-07 12:11:56,044 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 63 [2019-09-07 12:11:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:11:56,044 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-09-07 12:11:56,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 12:11:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-09-07 12:11:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 12:11:56,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:11:56,046 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:11:56,047 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:11:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:11:56,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1690278300, now seen corresponding path program 7 times [2019-09-07 12:11:56,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:11:56,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:11:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:56,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:11:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:11:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-07 12:11:56,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:11:56,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:11:56,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:11:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:11:56,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 12:11:56,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:11:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Stream closed [2019-09-07 12:11:56,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:11:56,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-09-07 12:11:56,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 12:11:56,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 12:11:56,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-09-07 12:11:56,279 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 15 states. [2019-09-07 12:11:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:11:56,426 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2019-09-07 12:11:56,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 12:11:56,426 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-09-07 12:11:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:11:56,427 INFO L225 Difference]: With dead ends: 119 [2019-09-07 12:11:56,428 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 12:11:56,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-09-07 12:11:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 12:11:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-07 12:11:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 12:11:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2019-09-07 12:11:56,438 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 65 [2019-09-07 12:11:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:11:56,439 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2019-09-07 12:11:56,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 12:11:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2019-09-07 12:11:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 12:11:56,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:11:56,440 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:11:56,441 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:11:56,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:11:56,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1266607074, now seen corresponding path program 8 times [2019-09-07 12:11:56,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:11:56,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:11:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:56,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:11:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:11:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 4 proven. 77 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-07 12:11:56,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:11:56,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:11:56,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:11:56,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:11:56,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:11:56,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 12:11:56,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:11:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 61 proven. 16 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:11:56,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:11:56,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2019-09-07 12:11:56,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 12:11:56,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 12:11:56,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-07 12:11:56,690 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 17 states. [2019-09-07 12:11:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:11:56,840 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-09-07 12:11:56,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:11:56,841 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-09-07 12:11:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:11:56,842 INFO L225 Difference]: With dead ends: 82 [2019-09-07 12:11:56,842 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 12:11:56,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-09-07 12:11:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 12:11:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-09-07 12:11:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 12:11:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-07 12:11:56,848 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 67 [2019-09-07 12:11:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:11:56,849 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-07 12:11:56,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 12:11:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-07 12:11:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 12:11:56,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:11:56,850 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:11:56,851 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:11:56,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:11:56,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1044420768, now seen corresponding path program 9 times [2019-09-07 12:11:56,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:11:56,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:11:56,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:56,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:11:56,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:11:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-07 12:11:56,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:11:56,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:11:56,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:11:57,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 12:11:57,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:11:57,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 12:11:57,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:11:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 106 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-07 12:11:57,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:11:57,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-07 12:11:57,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 12:11:57,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 12:11:57,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-09-07 12:11:57,127 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 18 states. [2019-09-07 12:11:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:11:57,364 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-09-07 12:11:57,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:11:57,364 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-09-07 12:11:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:11:57,365 INFO L225 Difference]: With dead ends: 66 [2019-09-07 12:11:57,365 INFO L226 Difference]: Without dead ends: 47 [2019-09-07 12:11:57,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-07 12:11:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-07 12:11:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-07 12:11:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 12:11:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-07 12:11:57,377 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 69 [2019-09-07 12:11:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:11:57,377 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-07 12:11:57,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 12:11:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-07 12:11:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 12:11:57,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:11:57,379 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:11:57,379 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:11:57,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:11:57,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1946275326, now seen corresponding path program 10 times [2019-09-07 12:11:57,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:11:57,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:11:57,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:57,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:11:57,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat