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/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:09:36,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:09:36,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:09:36,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:09:36,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:09:36,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:09:36,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:09:36,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:09:36,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:09:36,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:09:36,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:09:36,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:09:36,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:09:36,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:09:36,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:09:36,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:09:36,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:09:36,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:09:36,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:09:36,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:09:36,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:09:36,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:09:36,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:09:36,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:09:36,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:09:36,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:09:36,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:09:36,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:09:36,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:09:36,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:09:36,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:09:36,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:09:36,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:09:36,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:09:36,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:09:36,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:09:36,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:09:36,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:09:36,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:09:36,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:09:36,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:09:36,322 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-08 11:09:36,341 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:09:36,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:09:36,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:09:36,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:09:36,344 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:09:36,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:09:36,344 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:09:36,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:09:36,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:09:36,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:09:36,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:09:36,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:09:36,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:09:36,346 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:09:36,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:09:36,347 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:09:36,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:09:36,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:09:36,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:09:36,348 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:09:36,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:09:36,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:09:36,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:09:36,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:09:36,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:09:36,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:09:36,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:09:36,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:09:36,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:09:36,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:09:36,393 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:09:36,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:09:36,398 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:09:36,398 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:09:36,399 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:09:36,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bebf7da4/5e928e29e4f94fc6bc7a600d40fe83c5/FLAGe6a41a2e7 [2019-09-08 11:09:36,934 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:09:36,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:09:36,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bebf7da4/5e928e29e4f94fc6bc7a600d40fe83c5/FLAGe6a41a2e7 [2019-09-08 11:09:37,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bebf7da4/5e928e29e4f94fc6bc7a600d40fe83c5 [2019-09-08 11:09:37,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:09:37,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:09:37,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:09:37,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:09:37,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:09:37,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:09:37" (1/1) ... [2019-09-08 11:09:37,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37, skipping insertion in model container [2019-09-08 11:09:37,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:09:37" (1/1) ... [2019-09-08 11:09:37,327 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:09:37,370 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:09:37,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:09:37,767 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:09:37,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:09:37,870 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:09:37,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37 WrapperNode [2019-09-08 11:09:37,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:09:37,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:09:37,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:09:37,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:09:37,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37" (1/1) ... [2019-09-08 11:09:37,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37" (1/1) ... [2019-09-08 11:09:37,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37" (1/1) ... [2019-09-08 11:09:37,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37" (1/1) ... [2019-09-08 11:09:37,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37" (1/1) ... [2019-09-08 11:09:37,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37" (1/1) ... [2019-09-08 11:09:37,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37" (1/1) ... [2019-09-08 11:09:37,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:09:37,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:09:37,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:09:37,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:09:37,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37" (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-08 11:09:37,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:09:37,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:09:37,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:09:37,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:09:37,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:09:37,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:09:37,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:09:37,995 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:09:37,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:09:37,996 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:09:37,996 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:09:37,996 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:09:37,996 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:09:37,996 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:09:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:09:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:09:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:09:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:09:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:09:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:09:37,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:09:38,768 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:09:38,769 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:09:38,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:09:38 BoogieIcfgContainer [2019-09-08 11:09:38,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:09:38,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:09:38,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:09:38,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:09:38,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:09:37" (1/3) ... [2019-09-08 11:09:38,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49149de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:09:38, skipping insertion in model container [2019-09-08 11:09:38,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:09:37" (2/3) ... [2019-09-08 11:09:38,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49149de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:09:38, skipping insertion in model container [2019-09-08 11:09:38,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:09:38" (3/3) ... [2019-09-08 11:09:38,778 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:09:38,786 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:09:38,794 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:09:38,812 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:09:38,842 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:09:38,843 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:09:38,843 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:09:38,843 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:09:38,844 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:09:38,844 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:09:38,844 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:09:38,844 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:09:38,844 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:09:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-08 11:09:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:09:38,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:38,878 INFO L399 BasicCegarLoop]: trace histogram [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, 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-08 11:09:38,880 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:38,886 INFO L82 PathProgramCache]: Analyzing trace with hash 236206689, now seen corresponding path program 1 times [2019-09-08 11:09:38,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:38,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:38,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:38,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:39,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:39,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:09:39,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:09:39,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:09:39,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:39,342 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-08 11:09:39,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:39,436 INFO L93 Difference]: Finished difference Result 320 states and 511 transitions. [2019-09-08 11:09:39,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:09:39,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 11:09:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:39,462 INFO L225 Difference]: With dead ends: 320 [2019-09-08 11:09:39,462 INFO L226 Difference]: Without dead ends: 213 [2019-09-08 11:09:39,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-08 11:09:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-09-08 11:09:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-08 11:09:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 313 transitions. [2019-09-08 11:09:39,573 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 313 transitions. Word has length 64 [2019-09-08 11:09:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:39,574 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 313 transitions. [2019-09-08 11:09:39,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:09:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 313 transitions. [2019-09-08 11:09:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:09:39,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:39,577 INFO L399 BasicCegarLoop]: trace histogram [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, 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-08 11:09:39,578 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:39,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2118823319, now seen corresponding path program 1 times [2019-09-08 11:09:39,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:39,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:39,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:39,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:39,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:39,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:39,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:09:39,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:09:39,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:09:39,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:39,701 INFO L87 Difference]: Start difference. First operand 211 states and 313 transitions. Second operand 3 states. [2019-09-08 11:09:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:39,775 INFO L93 Difference]: Finished difference Result 523 states and 809 transitions. [2019-09-08 11:09:39,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:09:39,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 11:09:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:39,782 INFO L225 Difference]: With dead ends: 523 [2019-09-08 11:09:39,782 INFO L226 Difference]: Without dead ends: 351 [2019-09-08 11:09:39,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-08 11:09:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-09-08 11:09:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-08 11:09:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 532 transitions. [2019-09-08 11:09:39,835 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 532 transitions. Word has length 65 [2019-09-08 11:09:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:39,836 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 532 transitions. [2019-09-08 11:09:39,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:09:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 532 transitions. [2019-09-08 11:09:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:09:39,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:39,840 INFO L399 BasicCegarLoop]: trace histogram [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, 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-08 11:09:39,840 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:39,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash -953795146, now seen corresponding path program 1 times [2019-09-08 11:09:39,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:39,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:39,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:39,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:39,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:09:39,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:09:39,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:09:39,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:39,971 INFO L87 Difference]: Start difference. First operand 349 states and 532 transitions. Second operand 3 states. [2019-09-08 11:09:40,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:40,053 INFO L93 Difference]: Finished difference Result 905 states and 1414 transitions. [2019-09-08 11:09:40,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:09:40,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 11:09:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:40,059 INFO L225 Difference]: With dead ends: 905 [2019-09-08 11:09:40,059 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 11:09:40,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 11:09:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2019-09-08 11:09:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-08 11:09:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 916 transitions. [2019-09-08 11:09:40,104 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 916 transitions. Word has length 66 [2019-09-08 11:09:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:40,104 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 916 transitions. [2019-09-08 11:09:40,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:09:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 916 transitions. [2019-09-08 11:09:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:09:40,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:40,107 INFO L399 BasicCegarLoop]: trace histogram [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, 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-08 11:09:40,107 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:40,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:40,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1958601078, now seen corresponding path program 1 times [2019-09-08 11:09:40,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:40,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:40,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:40,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:40,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:09:40,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:09:40,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:09:40,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:40,219 INFO L87 Difference]: Start difference. First operand 593 states and 916 transitions. Second operand 3 states. [2019-09-08 11:09:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:40,277 INFO L93 Difference]: Finished difference Result 1573 states and 2462 transitions. [2019-09-08 11:09:40,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:09:40,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 11:09:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:40,284 INFO L225 Difference]: With dead ends: 1573 [2019-09-08 11:09:40,284 INFO L226 Difference]: Without dead ends: 1019 [2019-09-08 11:09:40,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:40,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-08 11:09:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1017. [2019-09-08 11:09:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2019-09-08 11:09:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1576 transitions. [2019-09-08 11:09:40,345 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1576 transitions. Word has length 67 [2019-09-08 11:09:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:40,346 INFO L475 AbstractCegarLoop]: Abstraction has 1017 states and 1576 transitions. [2019-09-08 11:09:40,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:09:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1576 transitions. [2019-09-08 11:09:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:09:40,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:40,348 INFO L399 BasicCegarLoop]: trace histogram [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, 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-08 11:09:40,348 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:40,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:40,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1238942495, now seen corresponding path program 1 times [2019-09-08 11:09:40,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:40,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:40,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:40,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:40,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:40,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:40,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:09:40,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:09:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:09:40,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:09:40,579 INFO L87 Difference]: Start difference. First operand 1017 states and 1576 transitions. Second operand 7 states. [2019-09-08 11:09:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:40,987 INFO L93 Difference]: Finished difference Result 5267 states and 8205 transitions. [2019-09-08 11:09:40,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:09:40,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-08 11:09:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:41,012 INFO L225 Difference]: With dead ends: 5267 [2019-09-08 11:09:41,013 INFO L226 Difference]: Without dead ends: 4289 [2019-09-08 11:09:41,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:09:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states. [2019-09-08 11:09:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 4281. [2019-09-08 11:09:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-09-08 11:09:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 6648 transitions. [2019-09-08 11:09:41,301 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 6648 transitions. Word has length 68 [2019-09-08 11:09:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:41,304 INFO L475 AbstractCegarLoop]: Abstraction has 4281 states and 6648 transitions. [2019-09-08 11:09:41,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:09:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 6648 transitions. [2019-09-08 11:09:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:09:41,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:41,307 INFO L399 BasicCegarLoop]: trace histogram [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, 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-08 11:09:41,307 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:41,308 INFO L82 PathProgramCache]: Analyzing trace with hash 691911688, now seen corresponding path program 1 times [2019-09-08 11:09:41,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:41,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:41,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:41,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:41,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:41,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:41,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:09:41,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:09:41,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:09:41,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:09:41,480 INFO L87 Difference]: Start difference. First operand 4281 states and 6648 transitions. Second operand 6 states. [2019-09-08 11:09:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:42,493 INFO L93 Difference]: Finished difference Result 16783 states and 26091 transitions. [2019-09-08 11:09:42,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:09:42,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 11:09:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:42,565 INFO L225 Difference]: With dead ends: 16783 [2019-09-08 11:09:42,567 INFO L226 Difference]: Without dead ends: 12541 [2019-09-08 11:09:42,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:09:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12541 states. [2019-09-08 11:09:43,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12541 to 12537. [2019-09-08 11:09:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12537 states. [2019-09-08 11:09:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12537 states to 12537 states and 19416 transitions. [2019-09-08 11:09:43,490 INFO L78 Accepts]: Start accepts. Automaton has 12537 states and 19416 transitions. Word has length 70 [2019-09-08 11:09:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:43,491 INFO L475 AbstractCegarLoop]: Abstraction has 12537 states and 19416 transitions. [2019-09-08 11:09:43,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:09:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 12537 states and 19416 transitions. [2019-09-08 11:09:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:09:43,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:43,493 INFO L399 BasicCegarLoop]: trace histogram [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, 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-08 11:09:43,493 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:43,503 INFO L82 PathProgramCache]: Analyzing trace with hash 194818221, now seen corresponding path program 1 times [2019-09-08 11:09:43,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:43,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:43,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:43,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:43,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:43,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:43,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:09:43,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:09:43,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:09:43,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:09:43,734 INFO L87 Difference]: Start difference. First operand 12537 states and 19416 transitions. Second operand 7 states. [2019-09-08 11:09:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:46,517 INFO L93 Difference]: Finished difference Result 63661 states and 98694 transitions. [2019-09-08 11:09:46,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:09:46,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-08 11:09:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:46,671 INFO L225 Difference]: With dead ends: 63661 [2019-09-08 11:09:46,671 INFO L226 Difference]: Without dead ends: 51163 [2019-09-08 11:09:46,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:09:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51163 states. [2019-09-08 11:09:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51163 to 25033. [2019-09-08 11:09:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25033 states. [2019-09-08 11:09:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25033 states to 25033 states and 38312 transitions. [2019-09-08 11:09:49,236 INFO L78 Accepts]: Start accepts. Automaton has 25033 states and 38312 transitions. Word has length 70 [2019-09-08 11:09:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:49,237 INFO L475 AbstractCegarLoop]: Abstraction has 25033 states and 38312 transitions. [2019-09-08 11:09:49,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:09:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 25033 states and 38312 transitions. [2019-09-08 11:09:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:09:49,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:49,238 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1] [2019-09-08 11:09:49,239 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:49,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1725864837, now seen corresponding path program 1 times [2019-09-08 11:09:49,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:49,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:49,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:49,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:49,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:49,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:49,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:09:49,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:09:49,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:09:49,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:09:49,353 INFO L87 Difference]: Start difference. First operand 25033 states and 38312 transitions. Second operand 5 states. [2019-09-08 11:09:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:52,237 INFO L93 Difference]: Finished difference Result 50987 states and 77545 transitions. [2019-09-08 11:09:52,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:09:52,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:09:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:52,359 INFO L225 Difference]: With dead ends: 50987 [2019-09-08 11:09:52,359 INFO L226 Difference]: Without dead ends: 50985 [2019-09-08 11:09:52,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:09:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50985 states. [2019-09-08 11:09:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50985 to 25993. [2019-09-08 11:09:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25993 states. [2019-09-08 11:09:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25993 states to 25993 states and 39272 transitions. [2019-09-08 11:09:54,472 INFO L78 Accepts]: Start accepts. Automaton has 25993 states and 39272 transitions. Word has length 71 [2019-09-08 11:09:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:54,472 INFO L475 AbstractCegarLoop]: Abstraction has 25993 states and 39272 transitions. [2019-09-08 11:09:54,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:09:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 25993 states and 39272 transitions. [2019-09-08 11:09:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:09:54,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:54,474 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1] [2019-09-08 11:09:54,474 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:54,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1971822172, now seen corresponding path program 1 times [2019-09-08 11:09:54,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:54,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:54,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:54,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:54,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:54,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:54,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:09:54,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:09:54,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:09:54,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:54,550 INFO L87 Difference]: Start difference. First operand 25993 states and 39272 transitions. Second operand 3 states. [2019-09-08 11:09:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:56,561 INFO L93 Difference]: Finished difference Result 72421 states and 108834 transitions. [2019-09-08 11:09:56,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:09:56,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-08 11:09:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:56,640 INFO L225 Difference]: With dead ends: 72421 [2019-09-08 11:09:56,640 INFO L226 Difference]: Without dead ends: 46467 [2019-09-08 11:09:56,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46467 states. [2019-09-08 11:09:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46467 to 46033. [2019-09-08 11:09:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46033 states. [2019-09-08 11:09:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46033 states to 46033 states and 68304 transitions. [2019-09-08 11:09:59,806 INFO L78 Accepts]: Start accepts. Automaton has 46033 states and 68304 transitions. Word has length 72 [2019-09-08 11:09:59,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:59,806 INFO L475 AbstractCegarLoop]: Abstraction has 46033 states and 68304 transitions. [2019-09-08 11:09:59,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:09:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 46033 states and 68304 transitions. [2019-09-08 11:09:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:09:59,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:59,808 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1] [2019-09-08 11:09:59,808 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:59,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1665482865, now seen corresponding path program 1 times [2019-09-08 11:09:59,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:59,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:59,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:59,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:59,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:59,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:59,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:09:59,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:09:59,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:09:59,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:09:59,861 INFO L87 Difference]: Start difference. First operand 46033 states and 68304 transitions. Second operand 3 states. [2019-09-08 11:10:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:03,690 INFO L93 Difference]: Finished difference Result 91704 states and 136694 transitions. [2019-09-08 11:10:03,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:03,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-08 11:10:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:03,779 INFO L225 Difference]: With dead ends: 91704 [2019-09-08 11:10:03,779 INFO L226 Difference]: Without dead ends: 65749 [2019-09-08 11:10:03,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65749 states. [2019-09-08 11:10:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65749 to 65747. [2019-09-08 11:10:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65747 states. [2019-09-08 11:10:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65747 states to 65747 states and 96978 transitions. [2019-09-08 11:10:06,889 INFO L78 Accepts]: Start accepts. Automaton has 65747 states and 96978 transitions. Word has length 72 [2019-09-08 11:10:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:06,889 INFO L475 AbstractCegarLoop]: Abstraction has 65747 states and 96978 transitions. [2019-09-08 11:10:06,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:10:06,889 INFO L276 IsEmpty]: Start isEmpty. Operand 65747 states and 96978 transitions. [2019-09-08 11:10:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:10:06,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:06,909 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:10:06,909 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:06,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1046922902, now seen corresponding path program 1 times [2019-09-08 11:10:06,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:06,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:06,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:06,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:06,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:07,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:10:07,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:10:07,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:10:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:07,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:10:07,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:10:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:07,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:10:07,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:10:07,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:10:07,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:10:07,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:10:07,369 INFO L87 Difference]: Start difference. First operand 65747 states and 96978 transitions. Second operand 11 states. [2019-09-08 11:10:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:19,915 INFO L93 Difference]: Finished difference Result 245310 states and 361127 transitions. [2019-09-08 11:10:19,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:10:19,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 11:10:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:20,683 INFO L225 Difference]: With dead ends: 245310 [2019-09-08 11:10:20,684 INFO L226 Difference]: Without dead ends: 192060 [2019-09-08 11:10:20,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:10:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192060 states. [2019-09-08 11:10:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192060 to 92515. [2019-09-08 11:10:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92515 states. [2019-09-08 11:10:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92515 states to 92515 states and 135698 transitions. [2019-09-08 11:10:29,596 INFO L78 Accepts]: Start accepts. Automaton has 92515 states and 135698 transitions. Word has length 98 [2019-09-08 11:10:29,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:29,596 INFO L475 AbstractCegarLoop]: Abstraction has 92515 states and 135698 transitions. [2019-09-08 11:10:29,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:10:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 92515 states and 135698 transitions. [2019-09-08 11:10:29,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:10:29,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:29,621 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:10:29,622 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1941107553, now seen corresponding path program 1 times [2019-09-08 11:10:29,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:29,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:29,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:29,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:29,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:10:29,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:10:29,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:10:29,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:29,695 INFO L87 Difference]: Start difference. First operand 92515 states and 135698 transitions. Second operand 3 states. [2019-09-08 11:10:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:37,137 INFO L93 Difference]: Finished difference Result 202869 states and 297126 transitions. [2019-09-08 11:10:37,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:37,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:10:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:37,396 INFO L225 Difference]: With dead ends: 202869 [2019-09-08 11:10:37,396 INFO L226 Difference]: Without dead ends: 140035 [2019-09-08 11:10:37,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140035 states. [2019-09-08 11:10:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140035 to 133353. [2019-09-08 11:10:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133353 states. [2019-09-08 11:10:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133353 states to 133353 states and 193748 transitions. [2019-09-08 11:10:48,326 INFO L78 Accepts]: Start accepts. Automaton has 133353 states and 193748 transitions. Word has length 98 [2019-09-08 11:10:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:48,327 INFO L475 AbstractCegarLoop]: Abstraction has 133353 states and 193748 transitions. [2019-09-08 11:10:48,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:10:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 133353 states and 193748 transitions. [2019-09-08 11:10:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:10:48,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:48,348 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:10:48,348 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash 875408894, now seen corresponding path program 1 times [2019-09-08 11:10:48,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:48,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:48,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:48,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:48,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:10:48,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:10:48,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:10:48,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:48,420 INFO L87 Difference]: Start difference. First operand 133353 states and 193748 transitions. Second operand 3 states. [2019-09-08 11:10:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:59,612 INFO L93 Difference]: Finished difference Result 267125 states and 386935 transitions. [2019-09-08 11:10:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:59,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:10:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:59,979 INFO L225 Difference]: With dead ends: 267125 [2019-09-08 11:10:59,979 INFO L226 Difference]: Without dead ends: 185267 [2019-09-08 11:11:00,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:11:00,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185267 states. [2019-09-08 11:11:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185267 to 177193. [2019-09-08 11:11:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177193 states. [2019-09-08 11:11:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177193 states to 177193 states and 254621 transitions. [2019-09-08 11:11:14,622 INFO L78 Accepts]: Start accepts. Automaton has 177193 states and 254621 transitions. Word has length 98 [2019-09-08 11:11:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:14,622 INFO L475 AbstractCegarLoop]: Abstraction has 177193 states and 254621 transitions. [2019-09-08 11:11:14,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:11:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 177193 states and 254621 transitions. [2019-09-08 11:11:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:11:14,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:14,643 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:11:14,644 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:14,644 INFO L82 PathProgramCache]: Analyzing trace with hash 388573063, now seen corresponding path program 1 times [2019-09-08 11:11:14,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:14,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:14,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:14,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:14,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:14,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:14,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:11:14,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:11:14,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:11:14,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:11:14,707 INFO L87 Difference]: Start difference. First operand 177193 states and 254621 transitions. Second operand 3 states. [2019-09-08 11:11:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:30,944 INFO L93 Difference]: Finished difference Result 282679 states and 404565 transitions. [2019-09-08 11:11:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:11:30,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:11:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:31,216 INFO L225 Difference]: With dead ends: 282679 [2019-09-08 11:11:31,217 INFO L226 Difference]: Without dead ends: 184885 [2019-09-08 11:11:31,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:11:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184885 states. [2019-09-08 11:11:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184885 to 177105. [2019-09-08 11:11:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177105 states. [2019-09-08 11:11:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177105 states to 177105 states and 251560 transitions. [2019-09-08 11:11:43,129 INFO L78 Accepts]: Start accepts. Automaton has 177105 states and 251560 transitions. Word has length 98 [2019-09-08 11:11:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:43,129 INFO L475 AbstractCegarLoop]: Abstraction has 177105 states and 251560 transitions. [2019-09-08 11:11:43,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:11:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 177105 states and 251560 transitions. [2019-09-08 11:11:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:11:43,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:43,149 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:11:43,149 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:43,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:43,150 INFO L82 PathProgramCache]: Analyzing trace with hash -682452696, now seen corresponding path program 1 times [2019-09-08 11:11:43,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:43,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:43,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 11:11:43,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:43,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:11:43,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:11:43,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:11:43,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:11:43,229 INFO L87 Difference]: Start difference. First operand 177105 states and 251560 transitions. Second operand 5 states. [2019-09-08 11:12:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:04,812 INFO L93 Difference]: Finished difference Result 450655 states and 638951 transitions. [2019-09-08 11:12:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:12:04,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 11:12:04,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:05,225 INFO L225 Difference]: With dead ends: 450655 [2019-09-08 11:12:05,225 INFO L226 Difference]: Without dead ends: 273654 [2019-09-08 11:12:05,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:12:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273654 states. [2019-09-08 11:12:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273654 to 272635. [2019-09-08 11:12:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272635 states. [2019-09-08 11:12:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272635 states to 272635 states and 384766 transitions. [2019-09-08 11:12:29,297 INFO L78 Accepts]: Start accepts. Automaton has 272635 states and 384766 transitions. Word has length 98 [2019-09-08 11:12:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:29,298 INFO L475 AbstractCegarLoop]: Abstraction has 272635 states and 384766 transitions. [2019-09-08 11:12:29,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:12:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 272635 states and 384766 transitions. [2019-09-08 11:12:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:12:29,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:29,322 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:12:29,323 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 341981923, now seen corresponding path program 1 times [2019-09-08 11:12:29,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:29,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:29,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:29,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:12:29,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:12:29,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:12:29,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:29,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:12:29,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:12:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:12:29,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:12:29,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:12:29,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:12:29,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:12:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:12:29,689 INFO L87 Difference]: Start difference. First operand 272635 states and 384766 transitions. Second operand 11 states. [2019-09-08 11:13:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:26,053 INFO L93 Difference]: Finished difference Result 809253 states and 1140019 transitions. [2019-09-08 11:13:26,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:13:26,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 11:13:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:27,114 INFO L225 Difference]: With dead ends: 809253 [2019-09-08 11:13:27,115 INFO L226 Difference]: Without dead ends: 607853 [2019-09-08 11:13:27,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:13:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607853 states. [2019-09-08 11:13:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607853 to 299765. [2019-09-08 11:13:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299765 states. [2019-09-08 11:13:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299765 states to 299765 states and 423211 transitions. [2019-09-08 11:13:58,320 INFO L78 Accepts]: Start accepts. Automaton has 299765 states and 423211 transitions. Word has length 98 [2019-09-08 11:13:58,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:58,320 INFO L475 AbstractCegarLoop]: Abstraction has 299765 states and 423211 transitions. [2019-09-08 11:13:58,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:13:58,320 INFO L276 IsEmpty]: Start isEmpty. Operand 299765 states and 423211 transitions. [2019-09-08 11:13:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:13:58,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:58,341 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:58,341 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash -724995879, now seen corresponding path program 1 times [2019-09-08 11:13:58,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:58,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:58,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:58,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:13:58,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:58,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:58,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:58,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:58,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:58,423 INFO L87 Difference]: Start difference. First operand 299765 states and 423211 transitions. Second operand 5 states. [2019-09-08 11:14:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:42,640 INFO L93 Difference]: Finished difference Result 765916 states and 1079545 transitions. [2019-09-08 11:14:42,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:14:42,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 11:14:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:43,376 INFO L225 Difference]: With dead ends: 765916 [2019-09-08 11:14:43,376 INFO L226 Difference]: Without dead ends: 466348 [2019-09-08 11:14:43,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:14:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466348 states. [2019-09-08 11:15:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466348 to 464737. [2019-09-08 11:15:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464737 states. [2019-09-08 11:15:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464737 states to 464737 states and 652120 transitions. [2019-09-08 11:15:40,312 INFO L78 Accepts]: Start accepts. Automaton has 464737 states and 652120 transitions. Word has length 98 [2019-09-08 11:15:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:40,312 INFO L475 AbstractCegarLoop]: Abstraction has 464737 states and 652120 transitions. [2019-09-08 11:15:40,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:15:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 464737 states and 652120 transitions. [2019-09-08 11:15:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:15:40,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:40,337 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:15:40,337 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash 262432318, now seen corresponding path program 1 times [2019-09-08 11:15:40,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:40,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:40,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:40,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:15:40,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:15:40,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:40,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:15:40,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:15:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 11:15:40,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:15:40,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:15:40,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:15:40,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:15:40,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:15:40,646 INFO L87 Difference]: Start difference. First operand 464737 states and 652120 transitions. Second operand 11 states. [2019-09-08 11:17:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:05,172 INFO L93 Difference]: Finished difference Result 1095484 states and 1528348 transitions. [2019-09-08 11:17:05,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:17:05,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 11:17:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:06,714 INFO L225 Difference]: With dead ends: 1095484 [2019-09-08 11:17:06,714 INFO L226 Difference]: Without dead ends: 830863 [2019-09-08 11:17:07,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:17:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830863 states. [2019-09-08 11:18:16,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830863 to 486521. [2019-09-08 11:18:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486521 states. [2019-09-08 11:18:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486521 states to 486521 states and 682330 transitions. [2019-09-08 11:18:19,286 INFO L78 Accepts]: Start accepts. Automaton has 486521 states and 682330 transitions. Word has length 98 [2019-09-08 11:18:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:19,287 INFO L475 AbstractCegarLoop]: Abstraction has 486521 states and 682330 transitions. [2019-09-08 11:18:19,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:18:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 486521 states and 682330 transitions. [2019-09-08 11:18:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:18:19,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:19,319 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:18:19,319 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash -637256176, now seen corresponding path program 1 times [2019-09-08 11:18:19,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:19,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:19,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:19,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:19,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 11:18:19,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:19,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:18:19,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:18:19,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:18:19,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:18:19,392 INFO L87 Difference]: Start difference. First operand 486521 states and 682330 transitions. Second operand 5 states. [2019-09-08 11:19:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:43,105 INFO L93 Difference]: Finished difference Result 1249617 states and 1750544 transitions. [2019-09-08 11:19:43,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:19:43,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 11:19:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:44,464 INFO L225 Difference]: With dead ends: 1249617 [2019-09-08 11:19:44,465 INFO L226 Difference]: Without dead ends: 763403 [2019-09-08 11:19:44,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:19:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763403 states.