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/ldv-regression/ex3_forlist.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:44,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:44,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:44,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:44,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:44,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:44,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:44,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:44,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:44,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:44,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:44,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:44,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:44,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:44,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:44,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:44,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:44,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:44,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:44,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:44,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:44,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:44,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:44,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:44,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:44,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:44,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:44,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:44,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:44,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:44,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:44,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:44,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:44,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:44,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:44,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:44,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:44,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:44,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:44,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:44,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:44,858 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-20 13:00:44,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:44,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:44,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:44,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:44,874 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:44,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:44,875 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:44,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:44,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:44,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:44,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:44,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:44,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:44,876 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:44,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:44,877 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:44,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:44,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:44,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:44,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:44,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:44,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:44,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:44,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:44,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:44,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:44,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:44,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:44,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:44,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:44,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:44,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:44,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:44,945 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:44,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/ex3_forlist.i [2019-09-20 13:00:45,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfb9278b/3a82e93e67be4a0684ab9966c3cc6967/FLAG7f31857ec [2019-09-20 13:00:45,401 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:45,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i [2019-09-20 13:00:45,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfb9278b/3a82e93e67be4a0684ab9966c3cc6967/FLAG7f31857ec [2019-09-20 13:00:45,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfb9278b/3a82e93e67be4a0684ab9966c3cc6967 [2019-09-20 13:00:45,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:45,446 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:45,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:45,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:45,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:45,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:45" (1/1) ... [2019-09-20 13:00:45,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38efe2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45, skipping insertion in model container [2019-09-20 13:00:45,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:45" (1/1) ... [2019-09-20 13:00:45,467 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:45,488 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:45,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:45,717 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:45,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:45,894 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:45,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45 WrapperNode [2019-09-20 13:00:45,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:45,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:45,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:45,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:45,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45" (1/1) ... [2019-09-20 13:00:45,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45" (1/1) ... [2019-09-20 13:00:45,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45" (1/1) ... [2019-09-20 13:00:45,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45" (1/1) ... [2019-09-20 13:00:45,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45" (1/1) ... [2019-09-20 13:00:45,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45" (1/1) ... [2019-09-20 13:00:45,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45" (1/1) ... [2019-09-20 13:00:45,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:45,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:45,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:45,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:45,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45" (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-20 13:00:45,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:45,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:45,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2019-09-20 13:00:45,991 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-20 13:00:45,992 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-09-20 13:00:45,992 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-09-20 13:00:45,992 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2019-09-20 13:00:45,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:45,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2019-09-20 13:00:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-20 13:00:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:00:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:00:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-09-20 13:00:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:00:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-09-20 13:00:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:00:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:00:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:00:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:00:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:00:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:00:46,372 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:46,372 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-20 13:00:46,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:46 BoogieIcfgContainer [2019-09-20 13:00:46,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:46,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:46,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:46,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:46,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:45" (1/3) ... [2019-09-20 13:00:46,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d48799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:46, skipping insertion in model container [2019-09-20 13:00:46,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:45" (2/3) ... [2019-09-20 13:00:46,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d48799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:46, skipping insertion in model container [2019-09-20 13:00:46,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:46" (3/3) ... [2019-09-20 13:00:46,381 INFO L109 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2019-09-20 13:00:46,391 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:46,398 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:46,415 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:46,444 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:46,445 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:46,445 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:46,445 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:46,445 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:46,445 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:46,446 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:46,446 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:46,446 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-09-20 13:00:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 13:00:46,472 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:46,473 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:46,475 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:46,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1451885248, now seen corresponding path program 1 times [2019-09-20 13:00:46,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:46,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:46,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:46,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:46,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-20 13:00:46,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:46,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:46,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:46,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:46,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:46,740 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-09-20 13:00:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:46,828 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2019-09-20 13:00:46,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:46,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-20 13:00:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:46,843 INFO L225 Difference]: With dead ends: 86 [2019-09-20 13:00:46,844 INFO L226 Difference]: Without dead ends: 43 [2019-09-20 13:00:46,851 INFO L636 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-20 13:00:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-20 13:00:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-20 13:00:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 13:00:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-09-20 13:00:46,913 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 39 [2019-09-20 13:00:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:46,913 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-09-20 13:00:46,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-09-20 13:00:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-20 13:00:46,918 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:46,919 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:46,920 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:46,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:46,921 INFO L82 PathProgramCache]: Analyzing trace with hash -507187170, now seen corresponding path program 1 times [2019-09-20 13:00:46,921 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:46,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:46,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:46,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:00:47,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:47,063 INFO L224 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:47,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:47,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 13:00:47,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:00:47,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:00:47,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-20 13:00:47,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:00:47,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:00:47,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:00:47,229 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 4 states. [2019-09-20 13:00:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:47,271 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-09-20 13:00:47,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:47,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-20 13:00:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:47,280 INFO L225 Difference]: With dead ends: 67 [2019-09-20 13:00:47,281 INFO L226 Difference]: Without dead ends: 47 [2019-09-20 13:00:47,284 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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-20 13:00:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-20 13:00:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-09-20 13:00:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 13:00:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-09-20 13:00:47,298 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 41 [2019-09-20 13:00:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:47,298 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-09-20 13:00:47,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:00:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-09-20 13:00:47,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-20 13:00:47,300 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:47,301 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:47,301 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:47,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash -75669472, now seen corresponding path program 1 times [2019-09-20 13:00:47,302 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:47,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:47,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:47,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:47,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:00:47,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:47,456 INFO L224 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:47,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:47,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:00:47,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:00:47,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:47,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-20 13:00:47,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:47,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:47,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:47,583 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 5 states. [2019-09-20 13:00:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:47,625 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2019-09-20 13:00:47,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:00:47,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-09-20 13:00:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:47,628 INFO L225 Difference]: With dead ends: 77 [2019-09-20 13:00:47,629 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:00:47,630 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:00:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-20 13:00:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-20 13:00:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-09-20 13:00:47,644 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 43 [2019-09-20 13:00:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:47,644 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-09-20 13:00:47,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-09-20 13:00:47,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:00:47,647 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:47,647 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:47,648 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:47,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:47,648 INFO L82 PathProgramCache]: Analyzing trace with hash -176141410, now seen corresponding path program 2 times [2019-09-20 13:00:47,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:47,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:47,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:47,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:00:48,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:48,226 INFO L224 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) [2019-09-20 13:00:48,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:48,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-20 13:00:48,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:00:48,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-20 13:00:48,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:48,393 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 11 treesize of output 7 [2019-09-20 13:00:48,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:48,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:48,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:48,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-20 13:00:48,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:00:48,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:48,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:48,472 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-20 13:00:48,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:00:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:00:48,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:00:48,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-09-20 13:00:48,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:00:48,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:00:48,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:00:48,509 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 21 states. [2019-09-20 13:00:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:50,656 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2019-09-20 13:00:50,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-20 13:00:50,656 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2019-09-20 13:00:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:50,659 INFO L225 Difference]: With dead ends: 143 [2019-09-20 13:00:50,659 INFO L226 Difference]: Without dead ends: 126 [2019-09-20 13:00:50,661 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=467, Invalid=2395, Unknown=0, NotChecked=0, Total=2862 [2019-09-20 13:00:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-20 13:00:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2019-09-20 13:00:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-20 13:00:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2019-09-20 13:00:50,683 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 45 [2019-09-20 13:00:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:50,684 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2019-09-20 13:00:50,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:00:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2019-09-20 13:00:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:00:50,685 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:50,686 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:50,686 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:50,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash -938142676, now seen corresponding path program 1 times [2019-09-20 13:00:50,687 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:50,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:50,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:50,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:00:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 13:00:50,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:50,731 INFO L224 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) [2019-09-20 13:00:50,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:50,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:00:50,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-20 13:00:50,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:50,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-20 13:00:50,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:50,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:50,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:50,840 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand 5 states. [2019-09-20 13:00:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:50,870 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2019-09-20 13:00:50,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:00:50,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-20 13:00:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:50,875 INFO L225 Difference]: With dead ends: 169 [2019-09-20 13:00:50,875 INFO L226 Difference]: Without dead ends: 104 [2019-09-20 13:00:50,877 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-20 13:00:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-09-20 13:00:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-20 13:00:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2019-09-20 13:00:50,902 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 49 [2019-09-20 13:00:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:50,902 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2019-09-20 13:00:50,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:50,903 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2019-09-20 13:00:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:00:50,904 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:50,904 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:50,905 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:50,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:50,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2074490512, now seen corresponding path program 1 times [2019-09-20 13:00:50,905 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:50,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:50,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:50,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:50,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:00:51,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:51,235 INFO L224 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:51,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-20 13:00:51,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:51,397 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-20 13:00:51,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:51,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-20 13:00:51,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:00:51,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:51,472 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-20 13:00:51,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:00:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:00:51,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:51,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2019-09-20 13:00:51,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 13:00:51,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 13:00:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:51,483 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand 19 states. [2019-09-20 13:00:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:52,274 INFO L93 Difference]: Finished difference Result 183 states and 236 transitions. [2019-09-20 13:00:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:00:52,275 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2019-09-20 13:00:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:52,277 INFO L225 Difference]: With dead ends: 183 [2019-09-20 13:00:52,277 INFO L226 Difference]: Without dead ends: 156 [2019-09-20 13:00:52,279 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-20 13:00:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-20 13:00:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2019-09-20 13:00:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-20 13:00:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 192 transitions. [2019-09-20 13:00:52,307 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 192 transitions. Word has length 51 [2019-09-20 13:00:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:52,308 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 192 transitions. [2019-09-20 13:00:52,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 13:00:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 192 transitions. [2019-09-20 13:00:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:00:52,310 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:52,310 INFO L407 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:52,310 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:52,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1299631036, now seen corresponding path program 1 times [2019-09-20 13:00:52,311 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:52,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:52,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:52,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:52,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:00:53,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:53,014 INFO L224 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-20 13:00:53,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:53,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-20 13:00:53,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:53,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-09-20 13:00:53,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 13:00:53,123 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-09-20 13:00:53,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:53,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-09-20 13:00:53,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2019-09-20 13:00:53,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:53,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:53,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:53,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:17 [2019-09-20 13:00:53,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-09-20 13:00:53,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:53,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:53,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:53,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-09-20 13:00:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:00:53,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:53,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-09-20 13:00:53,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-20 13:00:53,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-20 13:00:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2019-09-20 13:00:53,638 INFO L87 Difference]: Start difference. First operand 151 states and 192 transitions. Second operand 35 states. [2019-09-20 13:00:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:55,989 INFO L93 Difference]: Finished difference Result 218 states and 273 transitions. [2019-09-20 13:00:55,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-20 13:00:55,990 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 51 [2019-09-20 13:00:55,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:55,991 INFO L225 Difference]: With dead ends: 218 [2019-09-20 13:00:55,991 INFO L226 Difference]: Without dead ends: 123 [2019-09-20 13:00:55,994 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=477, Invalid=2945, Unknown=0, NotChecked=0, Total=3422 [2019-09-20 13:00:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-20 13:00:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2019-09-20 13:00:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-20 13:00:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2019-09-20 13:00:56,008 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 51 [2019-09-20 13:00:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:56,009 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2019-09-20 13:00:56,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-20 13:00:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2019-09-20 13:00:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:00:56,010 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:56,010 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:56,011 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:56,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1038104393, now seen corresponding path program 1 times [2019-09-20 13:00:56,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:56,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:56,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:56,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:56,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:00:56,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:56,696 INFO L224 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-20 13:00:56,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:56,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-20 13:00:56,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:56,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-09-20 13:00:56,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:56,806 INFO L567 ElimStorePlain]: treesize reduction 12, result has 47.8 percent of original size [2019-09-20 13:00:56,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:56,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-09-20 13:00:57,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-09-20 13:00:57,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:57,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:57,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-09-20 13:00:57,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:57,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:57,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:57,063 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:22 [2019-09-20 13:00:57,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-09-20 13:00:57,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:57,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:57,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-09-20 13:00:57,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:57,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:57,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:57,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-09-20 13:00:57,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-09-20 13:00:57,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:57,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:57,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-09-20 13:00:57,348 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:57,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:57,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:57,362 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:13 [2019-09-20 13:00:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-20 13:00:57,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:57,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 38 [2019-09-20 13:00:57,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-20 13:00:57,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-20 13:00:57,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2019-09-20 13:00:57,424 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand 38 states. [2019-09-20 13:00:59,262 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-20 13:01:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:00,112 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2019-09-20 13:01:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-20 13:01:00,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 53 [2019-09-20 13:01:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:00,114 INFO L225 Difference]: With dead ends: 163 [2019-09-20 13:01:00,115 INFO L226 Difference]: Without dead ends: 88 [2019-09-20 13:01:00,117 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=433, Invalid=2873, Unknown=0, NotChecked=0, Total=3306 [2019-09-20 13:01:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-20 13:01:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-09-20 13:01:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-20 13:01:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-09-20 13:01:00,138 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 53 [2019-09-20 13:01:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:00,139 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-09-20 13:01:00,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-20 13:01:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-09-20 13:01:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:01:00,140 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:00,140 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:00,140 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:00,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1344139440, now seen corresponding path program 1 times [2019-09-20 13:01:00,141 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:00,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:00,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-20 13:01:00,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:00,225 INFO L224 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-20 13:01:00,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:00,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 13:01:00,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:01:00,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:01:00,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-09-20 13:01:00,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:01:00,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:01:00,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:01:00,329 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 6 states. [2019-09-20 13:01:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:00,364 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2019-09-20 13:01:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:01:00,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-20 13:01:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:00,366 INFO L225 Difference]: With dead ends: 138 [2019-09-20 13:01:00,366 INFO L226 Difference]: Without dead ends: 82 [2019-09-20 13:01:00,367 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:01:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-20 13:01:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-20 13:01:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-20 13:01:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-09-20 13:01:00,383 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 56 [2019-09-20 13:01:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:00,384 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-09-20 13:01:00,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:01:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-09-20 13:01:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:01:00,389 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:00,390 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:00,390 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1124359541, now seen corresponding path program 1 times [2019-09-20 13:01:00,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:00,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:00,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:00,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:00,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-20 13:01:00,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:00,991 INFO L224 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-20 13:01:01,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:01,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-20 13:01:01,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:01,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-09-20 13:01:01,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 13:01:01,102 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-09-20 13:01:01,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-09-20 13:01:01,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-20 13:01:01,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-09-20 13:01:01,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:01:01,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,661 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-20 13:01:01,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-09-20 13:01:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-20 13:01:01,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:01,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-09-20 13:01:01,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-20 13:01:01,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-20 13:01:01,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2019-09-20 13:01:01,713 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 36 states. [2019-09-20 13:01:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:03,328 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2019-09-20 13:01:03,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:01:03,329 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 61 [2019-09-20 13:01:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:03,331 INFO L225 Difference]: With dead ends: 128 [2019-09-20 13:01:03,331 INFO L226 Difference]: Without dead ends: 91 [2019-09-20 13:01:03,332 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=224, Invalid=2226, Unknown=0, NotChecked=0, Total=2450 [2019-09-20 13:01:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-20 13:01:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-09-20 13:01:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-20 13:01:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2019-09-20 13:01:03,341 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 61 [2019-09-20 13:01:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:03,341 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2019-09-20 13:01:03,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-20 13:01:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2019-09-20 13:01:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:01:03,342 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:03,342 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:03,343 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:03,343 INFO L82 PathProgramCache]: Analyzing trace with hash -426052747, now seen corresponding path program 2 times [2019-09-20 13:01:03,343 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:03,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:03,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:03,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:01:04,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:04,495 INFO L224 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:04,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:01:04,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:01:04,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:04,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-20 13:01:04,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:04,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-09-20 13:01:04,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:04,600 INFO L567 ElimStorePlain]: treesize reduction 12, result has 47.8 percent of original size [2019-09-20 13:01:04,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:04,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-09-20 13:01:04,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2019-09-20 13:01:04,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:04,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:04,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:04,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:17 [2019-09-20 13:01:05,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-09-20 13:01:05,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:05,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:05,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:05,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-09-20 13:01:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:01:05,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:05,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20] total 48 [2019-09-20 13:01:05,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-20 13:01:05,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-20 13:01:05,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2096, Unknown=0, NotChecked=0, Total=2256 [2019-09-20 13:01:05,333 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 48 states. [2019-09-20 13:01:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:07,890 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-09-20 13:01:07,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-20 13:01:07,891 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 61 [2019-09-20 13:01:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:07,892 INFO L225 Difference]: With dead ends: 101 [2019-09-20 13:01:07,892 INFO L226 Difference]: Without dead ends: 65 [2019-09-20 13:01:07,896 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=540, Invalid=5312, Unknown=0, NotChecked=0, Total=5852 [2019-09-20 13:01:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-20 13:01:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-20 13:01:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 13:01:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-20 13:01:07,910 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2019-09-20 13:01:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:07,913 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-20 13:01:07,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-20 13:01:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-20 13:01:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:01:07,917 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:07,917 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:07,917 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:07,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:07,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1890879125, now seen corresponding path program 3 times [2019-09-20 13:01:07,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:07,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:07,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:07,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:01:07,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:09,160 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-20 13:01:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:01:10,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:10,297 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:10,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:01:10,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 13:01:10,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:10,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-20 13:01:10,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:10,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-09-20 13:01:10,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:10,885 INFO L567 ElimStorePlain]: treesize reduction 12, result has 40.0 percent of original size [2019-09-20 13:01:10,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:10,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:8 [2019-09-20 13:01:11,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2019-09-20 13:01:11,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:11,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:11,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:11,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:14 [2019-09-20 13:01:11,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-09-20 13:01:11,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:11,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:11,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:11,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:8 [2019-09-20 13:01:12,581 WARN L191 SmtUtils]: Spent 857.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-20 13:01:12,594 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:12,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:12,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:12,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:34 [2019-09-20 13:01:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:01:14,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:14,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 22] total 56 [2019-09-20 13:01:14,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-20 13:01:14,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-20 13:01:14,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2901, Unknown=1, NotChecked=0, Total=3080 [2019-09-20 13:01:14,719 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 56 states. [2019-09-20 13:01:15,462 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-20 13:01:15,764 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-20 13:01:17,160 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-09-20 13:01:20,912 WARN L191 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-20 13:01:24,682 WARN L191 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 106 DAG size of output: 81